./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 26d01a9c 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-?-26d01a9 [2023-02-17 22:12:58,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 22:12:58,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 22:12:58,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 22:12:58,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 22:12:58,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 22:12:58,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 22:12:58,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 22:12:58,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 22:12:58,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 22:12:58,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 22:12:58,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 22:12:58,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 22:12:58,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 22:12:58,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 22:12:58,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 22:12:58,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 22:12:58,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 22:12:58,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 22:12:58,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 22:12:58,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 22:12:58,342 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 22:12:58,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 22:12:58,344 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 22:12:58,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 22:12:58,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 22:12:58,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 22:12:58,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 22:12:58,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 22:12:58,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 22:12:58,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 22:12:58,351 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 22:12:58,351 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 22:12:58,352 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 22:12:58,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 22:12:58,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 22:12:58,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 22:12:58,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 22:12:58,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 22:12:58,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 22:12:58,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 22:12:58,356 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 22:12:58,382 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 22:12:58,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 22:12:58,383 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 22:12:58,383 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 22:12:58,383 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 22:12:58,384 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 22:12:58,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 22:12:58,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 22:12:58,384 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 22:12:58,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 22:12:58,385 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 22:12:58,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 22:12:58,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 22:12:58,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 22:12:58,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 22:12:58,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 22:12:58,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 22:12:58,386 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 22:12:58,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 22:12:58,386 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 22:12:58,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 22:12:58,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 22:12:58,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 22:12:58,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 22:12:58,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 22:12:58,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 22:12:58,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 22:12:58,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 22:12:58,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 22:12:58,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 22:12:58,388 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 22:12:58,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 22:12:58,389 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 22:12:58,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 22:12:58,389 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 22:12:58,389 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-17 22:12:58,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 22:12:58,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 22:12:58,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 22:12:58,646 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 22:12:58,646 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 22:12:58,647 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-17 22:12:59,744 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 22:12:59,938 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 22:12:59,938 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2023-02-17 22:12:59,945 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1bbbc9aa/22a29600ec7c4a9c99097c9bbde0725d/FLAGd3fdc3187 [2023-02-17 22:12:59,956 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1bbbc9aa/22a29600ec7c4a9c99097c9bbde0725d [2023-02-17 22:12:59,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 22:12:59,959 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 22:12:59,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 22:12:59,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 22:12:59,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 22:12:59,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 10:12:59" (1/1) ... [2023-02-17 22:12:59,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9b113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:12:59, skipping insertion in model container [2023-02-17 22:12:59,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 10:12:59" (1/1) ... [2023-02-17 22:12:59,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 22:12:59,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 22:13:00,101 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-17 22:13:00,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 22:13:00,118 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 22:13:00,136 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-17 22:13:00,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 22:13:00,148 INFO L208 MainTranslator]: Completed translation [2023-02-17 22:13:00,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:00 WrapperNode [2023-02-17 22:13:00,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 22:13:00,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 22:13:00,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 22:13:00,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 22:13:00,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:00" (1/1) ... [2023-02-17 22:13:00,162 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:00" (1/1) ... [2023-02-17 22:13:00,175 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2023-02-17 22:13:00,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 22:13:00,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 22:13:00,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 22:13:00,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 22:13:00,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:00" (1/1) ... [2023-02-17 22:13:00,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:00" (1/1) ... [2023-02-17 22:13:00,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:00" (1/1) ... [2023-02-17 22:13:00,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:00" (1/1) ... [2023-02-17 22:13:00,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:00" (1/1) ... [2023-02-17 22:13:00,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:00" (1/1) ... [2023-02-17 22:13:00,196 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:00" (1/1) ... [2023-02-17 22:13:00,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:00" (1/1) ... [2023-02-17 22:13:00,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 22:13:00,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 22:13:00,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 22:13:00,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 22:13:00,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:00" (1/1) ... [2023-02-17 22:13:00,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 22:13:00,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 22:13:00,229 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-17 22:13:00,257 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-17 22:13:00,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 22:13:00,276 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2023-02-17 22:13:00,276 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2023-02-17 22:13:00,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 22:13:00,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 22:13:00,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 22:13:00,329 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 22:13:00,330 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 22:13:00,441 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 22:13:00,446 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 22:13:00,447 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 22:13:00,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:13:00 BoogieIcfgContainer [2023-02-17 22:13:00,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 22:13:00,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 22:13:00,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 22:13:00,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 22:13:00,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 10:12:59" (1/3) ... [2023-02-17 22:13:00,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63223c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 10:13:00, skipping insertion in model container [2023-02-17 22:13:00,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:00" (2/3) ... [2023-02-17 22:13:00,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63223c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 10:13:00, skipping insertion in model container [2023-02-17 22:13:00,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:13:00" (3/3) ... [2023-02-17 22:13:00,456 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2023-02-17 22:13:00,471 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 22:13:00,472 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 22:13:00,508 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 22:13:00,515 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;@16625137, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 22:13:00,515 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 22:13:00,518 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-17 22:13:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 22:13:00,523 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:13:00,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:13:00,524 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:13:00,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:13:00,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2023-02-17 22:13:00,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 22:13:00,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480069027] [2023-02-17 22:13:00,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 22:13:00,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 22:13:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 22:13:00,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 22:13:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 22:13:00,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 22:13:00,706 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 22:13:00,707 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 22:13:00,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 22:13:00,713 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-02-17 22:13:00,716 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 22:13:00,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 10:13:00 BoogieIcfgContainer [2023-02-17 22:13:00,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 22:13:00,740 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 22:13:00,741 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 22:13:00,741 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 22:13:00,741 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:13:00" (3/4) ... [2023-02-17 22:13:00,744 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-17 22:13:00,744 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 22:13:00,745 INFO L158 Benchmark]: Toolchain (without parser) took 786.09ms. Allocated memory is still 148.9MB. Free memory was 117.2MB in the beginning and 100.9MB in the end (delta: 16.2MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2023-02-17 22:13:00,745 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 123.7MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 22:13:00,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.81ms. Allocated memory is still 148.9MB. Free memory was 117.2MB in the beginning and 107.5MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 22:13:00,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.57ms. Allocated memory is still 148.9MB. Free memory was 107.5MB in the beginning and 106.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 22:13:00,747 INFO L158 Benchmark]: Boogie Preprocessor took 23.75ms. Allocated memory is still 148.9MB. Free memory was 106.2MB in the beginning and 104.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 22:13:00,747 INFO L158 Benchmark]: RCFGBuilder took 247.47ms. Allocated memory is still 148.9MB. Free memory was 104.7MB in the beginning and 115.6MB in the end (delta: -10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 22:13:00,748 INFO L158 Benchmark]: TraceAbstraction took 289.42ms. Allocated memory is still 148.9MB. Free memory was 115.0MB in the beginning and 101.7MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-17 22:13:00,748 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 148.9MB. Free memory was 101.7MB in the beginning and 100.9MB in the end (delta: 757.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 22:13:00,751 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 123.7MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.81ms. Allocated memory is still 148.9MB. Free memory was 117.2MB in the beginning and 107.5MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.57ms. Allocated memory is still 148.9MB. Free memory was 107.5MB in the beginning and 106.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.75ms. Allocated memory is still 148.9MB. Free memory was 106.2MB in the beginning and 104.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 247.47ms. Allocated memory is still 148.9MB. Free memory was 104.7MB in the beginning and 115.6MB in the end (delta: -10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 289.42ms. Allocated memory is still 148.9MB. Free memory was 115.0MB in the beginning and 101.7MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 148.9MB. Free memory was 101.7MB in the beginning and 100.9MB in the end (delta: 757.3kB). 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-17 22:13:03,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 22:13:03,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 22:13:03,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 22:13:03,368 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 22:13:03,368 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 22:13:03,370 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-17 22:13:04,612 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 22:13:04,825 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 22:13:04,826 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2023-02-17 22:13:04,830 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe36b4ff/37c4ef65c8394d849fb3f48d3e14866f/FLAG81e753921 [2023-02-17 22:13:04,840 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe36b4ff/37c4ef65c8394d849fb3f48d3e14866f [2023-02-17 22:13:04,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 22:13:04,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 22:13:04,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 22:13:04,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 22:13:04,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 22:13:04,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 10:13:04" (1/1) ... [2023-02-17 22:13:04,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d1c76d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:04, skipping insertion in model container [2023-02-17 22:13:04,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 10:13:04" (1/1) ... [2023-02-17 22:13:04,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 22:13:04,870 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 22:13:04,974 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-17 22:13:04,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 22:13:04,990 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 22:13:05,009 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-17 22:13:05,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 22:13:05,021 INFO L208 MainTranslator]: Completed translation [2023-02-17 22:13:05,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:05 WrapperNode [2023-02-17 22:13:05,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 22:13:05,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 22:13:05,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 22:13:05,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 22:13:05,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:05" (1/1) ... [2023-02-17 22:13:05,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:05" (1/1) ... [2023-02-17 22:13:05,049 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2023-02-17 22:13:05,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 22:13:05,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 22:13:05,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 22:13:05,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 22:13:05,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:05" (1/1) ... [2023-02-17 22:13:05,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:05" (1/1) ... [2023-02-17 22:13:05,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:05" (1/1) ... [2023-02-17 22:13:05,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:05" (1/1) ... [2023-02-17 22:13:05,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:05" (1/1) ... [2023-02-17 22:13:05,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:05" (1/1) ... [2023-02-17 22:13:05,078 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:05" (1/1) ... [2023-02-17 22:13:05,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:05" (1/1) ... [2023-02-17 22:13:05,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 22:13:05,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 22:13:05,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 22:13:05,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 22:13:05,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:05" (1/1) ... [2023-02-17 22:13:05,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 22:13:05,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 22:13:05,110 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-17 22:13:05,131 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-17 22:13:05,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 22:13:05,146 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2023-02-17 22:13:05,146 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2023-02-17 22:13:05,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 22:13:05,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 22:13:05,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-17 22:13:05,260 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 22:13:05,262 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 22:13:05,401 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 22:13:05,406 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 22:13:05,413 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 22:13:05,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:13:05 BoogieIcfgContainer [2023-02-17 22:13:05,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 22:13:05,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 22:13:05,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 22:13:05,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 22:13:05,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 10:13:04" (1/3) ... [2023-02-17 22:13:05,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283a0757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 10:13:05, skipping insertion in model container [2023-02-17 22:13:05,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 10:13:05" (2/3) ... [2023-02-17 22:13:05,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283a0757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 10:13:05, skipping insertion in model container [2023-02-17 22:13:05,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:13:05" (3/3) ... [2023-02-17 22:13:05,423 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2023-02-17 22:13:05,438 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 22:13:05,438 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 22:13:05,494 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 22:13:05,500 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;@574b9fe6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 22:13:05,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 22:13:05,504 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-17 22:13:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 22:13:05,510 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:13:05,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:13:05,512 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:13:05,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:13:05,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2023-02-17 22:13:05,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:13:05,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350083407] [2023-02-17 22:13:05,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 22:13:05,527 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-17 22:13:05,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:13:05,531 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-17 22:13:05,536 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-17 22:13:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:13:05,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 22:13:05,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:13:05,691 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-17 22:13:05,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 22:13:05,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:13:05,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350083407] [2023-02-17 22:13:05,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350083407] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 22:13:05,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 22:13:05,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 22:13:05,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658776839] [2023-02-17 22:13:05,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 22:13:05,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 22:13:05,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:13:05,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 22:13:05,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-17 22:13:05,762 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-17 22:13:05,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:13:05,860 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-02-17 22:13:05,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 22:13:05,866 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-17 22:13:05,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:13:05,873 INFO L225 Difference]: With dead ends: 32 [2023-02-17 22:13:05,873 INFO L226 Difference]: Without dead ends: 16 [2023-02-17 22:13:05,876 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-17 22:13:05,880 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-17 22:13:05,881 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-17 22:13:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-02-17 22:13:05,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-02-17 22:13:05,909 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-17 22:13:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-02-17 22:13:05,911 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2023-02-17 22:13:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:13:05,911 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-02-17 22:13:05,912 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-17 22:13:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2023-02-17 22:13:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 22:13:05,913 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:13:05,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:13:05,928 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 (2)] Forceful destruction successful, exit code 0 [2023-02-17 22:13:06,122 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-17 22:13:06,123 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:13:06,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:13:06,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2053638732, now seen corresponding path program 1 times [2023-02-17 22:13:06,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:13:06,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826473506] [2023-02-17 22:13:06,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 22:13:06,124 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-17 22:13:06,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:13:06,126 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-17 22:13:06,129 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-17 22:13:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:13:06,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 22:13:06,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:13:06,237 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-17 22:13:06,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:13:06,504 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-17 22:13:06,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:13:06,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826473506] [2023-02-17 22:13:06,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826473506] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 22:13:06,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 22:13:06,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-02-17 22:13:06,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690570962] [2023-02-17 22:13:06,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 22:13:06,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 22:13:06,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:13:06,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 22:13:06,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-02-17 22:13:06,509 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-17 22:13:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:13:06,782 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-02-17 22:13:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 22:13:06,783 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-17 22:13:06,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:13:06,784 INFO L225 Difference]: With dead ends: 28 [2023-02-17 22:13:06,784 INFO L226 Difference]: Without dead ends: 22 [2023-02-17 22:13:06,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2023-02-17 22:13:06,786 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-17 22:13:06,786 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-17 22:13:06,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-17 22:13:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-17 22:13:06,790 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-17 22:13:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2023-02-17 22:13:06,791 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2023-02-17 22:13:06,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:13:06,791 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2023-02-17 22:13:06,792 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-17 22:13:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2023-02-17 22:13:06,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 22:13:06,796 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:13:06,796 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:13:06,806 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-17 22:13:07,005 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-17 22:13:07,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:13:07,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:13:07,013 INFO L85 PathProgramCache]: Analyzing trace with hash -491101836, now seen corresponding path program 2 times [2023-02-17 22:13:07,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:13:07,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808043188] [2023-02-17 22:13:07,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 22:13:07,017 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-17 22:13:07,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:13:07,019 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-17 22:13:07,068 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-17 22:13:07,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 22:13:07,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 22:13:07,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 22:13:07,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:13:07,238 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-17 22:13:07,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:13:08,069 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-17 22:13:08,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:13:08,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808043188] [2023-02-17 22:13:08,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808043188] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 22:13:08,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 22:13:08,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2023-02-17 22:13:08,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715550087] [2023-02-17 22:13:08,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 22:13:08,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-17 22:13:08,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:13:08,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-17 22:13:08,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2023-02-17 22:13:08,078 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-17 22:13:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:13:08,675 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2023-02-17 22:13:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 22:13:08,676 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-17 22:13:08,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:13:08,677 INFO L225 Difference]: With dead ends: 34 [2023-02-17 22:13:08,678 INFO L226 Difference]: Without dead ends: 28 [2023-02-17 22:13:08,678 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-17 22:13:08,679 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-17 22:13:08,680 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-17 22:13:08,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-17 22:13:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-17 22:13:08,684 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-17 22:13:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2023-02-17 22:13:08,685 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 29 [2023-02-17 22:13:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:13:08,686 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2023-02-17 22:13:08,686 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-17 22:13:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2023-02-17 22:13:08,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-17 22:13:08,687 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:13:08,687 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:13:08,696 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-17 22:13:08,896 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-17 22:13:08,896 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:13:08,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:13:08,897 INFO L85 PathProgramCache]: Analyzing trace with hash -492655308, now seen corresponding path program 3 times [2023-02-17 22:13:08,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:13:08,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665637695] [2023-02-17 22:13:08,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 22:13:08,898 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-17 22:13:08,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:13:08,899 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-17 22:13:08,902 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-17 22:13:08,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-17 22:13:08,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 22:13:08,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-17 22:13:08,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:13:09,131 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-17 22:13:09,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:13:10,610 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-17 22:13:10,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:13:10,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665637695] [2023-02-17 22:13:10,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665637695] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 22:13:10,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 22:13:10,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2023-02-17 22:13:10,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698508749] [2023-02-17 22:13:10,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 22:13:10,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-17 22:13:10,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:13:10,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-17 22:13:10,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2023-02-17 22:13:10,614 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-17 22:13:11,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:13:11,532 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2023-02-17 22:13:11,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-17 22:13:11,532 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-17 22:13:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:13:11,533 INFO L225 Difference]: With dead ends: 40 [2023-02-17 22:13:11,534 INFO L226 Difference]: Without dead ends: 34 [2023-02-17 22:13:11,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=290, Invalid=2260, Unknown=0, NotChecked=0, Total=2550 [2023-02-17 22:13:11,536 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-17 22:13:11,536 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-17 22:13:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-17 22:13:11,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-02-17 22:13:11,541 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-17 22:13:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2023-02-17 22:13:11,542 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 41 [2023-02-17 22:13:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:13:11,542 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2023-02-17 22:13:11,542 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-17 22:13:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2023-02-17 22:13:11,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-17 22:13:11,544 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:13:11,544 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:13:11,551 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 (5)] Ended with exit code 0 [2023-02-17 22:13:11,751 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-17 22:13:11,751 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:13:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:13:11,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1906255628, now seen corresponding path program 4 times [2023-02-17 22:13:11,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:13:11,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075425040] [2023-02-17 22:13:11,753 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 22:13:11,753 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-17 22:13:11,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:13:11,754 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-17 22:13:11,755 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-17 22:13:11,823 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 22:13:11,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 22:13:11,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-17 22:13:11,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:13:12,095 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-17 22:13:12,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:13:14,336 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-17 22:13:14,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:13:14,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075425040] [2023-02-17 22:13:14,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075425040] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 22:13:14,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 22:13:14,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 46 [2023-02-17 22:13:14,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683556933] [2023-02-17 22:13:14,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 22:13:14,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-17 22:13:14,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:13:14,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-17 22:13:14,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2023-02-17 22:13:14,341 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-17 22:13:15,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:13:15,683 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2023-02-17 22:13:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-17 22:13:15,691 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-17 22:13:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:13:15,694 INFO L225 Difference]: With dead ends: 46 [2023-02-17 22:13:15,694 INFO L226 Difference]: Without dead ends: 40 [2023-02-17 22:13:15,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 50 SyntacticMatches, 10 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=414, Invalid=3746, Unknown=0, NotChecked=0, Total=4160 [2023-02-17 22:13:15,698 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-17 22:13:15,698 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-17 22:13:15,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-17 22:13:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-02-17 22:13:15,704 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-17 22:13:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2023-02-17 22:13:15,705 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 53 [2023-02-17 22:13:15,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:13:15,706 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2023-02-17 22:13:15,706 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-17 22:13:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2023-02-17 22:13:15,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-17 22:13:15,709 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:13:15,709 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:13:15,716 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-17 22:13:15,913 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-17 22:13:15,913 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:13:15,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:13:15,914 INFO L85 PathProgramCache]: Analyzing trace with hash 788849844, now seen corresponding path program 5 times [2023-02-17 22:13:15,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:13:15,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497609733] [2023-02-17 22:13:15,914 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 22:13:15,914 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-17 22:13:15,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:13:15,915 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-17 22:13:15,916 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-17 22:13:15,963 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-02-17 22:13:15,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 22:13:15,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-17 22:13:15,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:13:16,342 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-17 22:13:16,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:13:19,477 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-17 22:13:19,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:13:19,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497609733] [2023-02-17 22:13:19,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497609733] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 22:13:19,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 22:13:19,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2023-02-17 22:13:19,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815716350] [2023-02-17 22:13:19,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 22:13:19,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-17 22:13:19,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:13:19,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-17 22:13:19,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2023-02-17 22:13:19,481 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-17 22:13:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:13:21,472 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2023-02-17 22:13:21,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-17 22:13:21,472 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-17 22:13:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:13:21,473 INFO L225 Difference]: With dead ends: 52 [2023-02-17 22:13:21,473 INFO L226 Difference]: Without dead ends: 46 [2023-02-17 22:13:21,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 62 SyntacticMatches, 12 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=554, Invalid=5608, Unknown=0, NotChecked=0, Total=6162 [2023-02-17 22:13:21,475 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-17 22:13:21,476 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-17 22:13:21,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-17 22:13:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-02-17 22:13:21,481 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-17 22:13:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2023-02-17 22:13:21,482 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 65 [2023-02-17 22:13:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:13:21,482 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2023-02-17 22:13:21,483 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-17 22:13:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2023-02-17 22:13:21,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-17 22:13:21,484 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:13:21,484 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:13:21,495 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-17 22:13:21,695 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-17 22:13:21,695 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:13:21,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:13:21,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1302253684, now seen corresponding path program 6 times [2023-02-17 22:13:21,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:13:21,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959794466] [2023-02-17 22:13:21,699 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 22:13:21,699 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-17 22:13:21,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:13:21,701 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-17 22:13:21,702 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-17 22:13:21,768 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2023-02-17 22:13:21,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 22:13:21,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-17 22:13:21,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:13:22,247 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-17 22:13:22,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:13:26,582 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-17 22:13:26,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:13:26,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959794466] [2023-02-17 22:13:26,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959794466] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 22:13:26,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 22:13:26,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39] total 66 [2023-02-17 22:13:26,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215249922] [2023-02-17 22:13:26,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 22:13:26,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-02-17 22:13:26,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:13:26,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-02-17 22:13:26,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4057, Unknown=0, NotChecked=0, Total=4290 [2023-02-17 22:13:26,586 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-17 22:13:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:13:29,204 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2023-02-17 22:13:29,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-17 22:13:29,209 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-17 22:13:29,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:13:29,210 INFO L225 Difference]: With dead ends: 58 [2023-02-17 22:13:29,210 INFO L226 Difference]: Without dead ends: 52 [2023-02-17 22:13:29,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 74 SyntacticMatches, 14 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=710, Invalid=7846, Unknown=0, NotChecked=0, Total=8556 [2023-02-17 22:13:29,213 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 84 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2023-02-17 22:13:29,214 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.2s Time] [2023-02-17 22:13:29,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-17 22:13:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-02-17 22:13:29,219 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-17 22:13:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2023-02-17 22:13:29,219 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 77 [2023-02-17 22:13:29,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:13:29,220 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2023-02-17 22:13:29,220 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-17 22:13:29,220 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2023-02-17 22:13:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-02-17 22:13:29,222 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:13:29,222 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:13:29,233 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 (8)] Forceful destruction successful, exit code 0 [2023-02-17 22:13:29,431 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-17 22:13:29,432 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:13:29,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:13:29,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1287742412, now seen corresponding path program 7 times [2023-02-17 22:13:29,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:13:29,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754270343] [2023-02-17 22:13:29,433 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-17 22:13:29,433 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-17 22:13:29,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:13:29,434 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-17 22:13:29,437 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-17 22:13:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:13:29,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-17 22:13:29,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:13:30,134 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-17 22:13:30,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:13:36,176 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-17 22:13:36,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:13:36,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754270343] [2023-02-17 22:13:36,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754270343] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 22:13:36,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 22:13:36,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 45] total 76 [2023-02-17 22:13:36,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406567655] [2023-02-17 22:13:36,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 22:13:36,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2023-02-17 22:13:36,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:13:36,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2023-02-17 22:13:36,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=5429, Unknown=0, NotChecked=0, Total=5700 [2023-02-17 22:13:36,181 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-17 22:13:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:13:39,883 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2023-02-17 22:13:39,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-17 22:13:39,883 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-17 22:13:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:13:39,884 INFO L225 Difference]: With dead ends: 64 [2023-02-17 22:13:39,885 INFO L226 Difference]: Without dead ends: 58 [2023-02-17 22:13:39,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 86 SyntacticMatches, 16 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=882, Invalid=10460, Unknown=0, NotChecked=0, Total=11342 [2023-02-17 22:13:39,888 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.7s IncrementalHoareTripleChecker+Time [2023-02-17 22:13:39,888 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.7s Time] [2023-02-17 22:13:39,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-17 22:13:39,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-02-17 22:13:39,893 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-17 22:13:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2023-02-17 22:13:39,894 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 89 [2023-02-17 22:13:39,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:13:39,894 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2023-02-17 22:13:39,895 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-17 22:13:39,895 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2023-02-17 22:13:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-17 22:13:39,896 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:13:39,896 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:13:39,905 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-17 22:13:40,101 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-17 22:13:40,101 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:13:40,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:13:40,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1760839668, now seen corresponding path program 8 times [2023-02-17 22:13:40,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:13:40,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226801163] [2023-02-17 22:13:40,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 22:13:40,102 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-17 22:13:40,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:13:40,103 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-17 22:13:40,104 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-17 22:13:40,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 22:13:40,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 22:13:40,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 68 conjunts are in the unsatisfiable core [2023-02-17 22:13:40,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:13:40,936 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-17 22:13:40,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:13:48,891 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-17 22:13:48,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:13:48,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226801163] [2023-02-17 22:13:48,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226801163] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 22:13:48,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 22:13:48,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 51] total 86 [2023-02-17 22:13:48,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268725062] [2023-02-17 22:13:48,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 22:13:48,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2023-02-17 22:13:48,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:13:48,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2023-02-17 22:13:48,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=7001, Unknown=0, NotChecked=0, Total=7310 [2023-02-17 22:13:48,898 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-17 22:13:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:13:54,023 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2023-02-17 22:13:54,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-17 22:13:54,023 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-17 22:13:54,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:13:54,025 INFO L225 Difference]: With dead ends: 70 [2023-02-17 22:13:54,025 INFO L226 Difference]: Without dead ends: 64 [2023-02-17 22:13:54,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 98 SyntacticMatches, 18 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1906 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=1070, Invalid=13450, Unknown=0, NotChecked=0, Total=14520 [2023-02-17 22:13:54,029 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 516 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.3s IncrementalHoareTripleChecker+Time [2023-02-17 22:13:54,033 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.3s Time] [2023-02-17 22:13:54,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-17 22:13:54,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-02-17 22:13:54,047 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-17 22:13:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2023-02-17 22:13:54,047 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 101 [2023-02-17 22:13:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:13:54,048 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2023-02-17 22:13:54,048 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-17 22:13:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2023-02-17 22:13:54,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-02-17 22:13:54,050 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:13:54,050 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:13:54,062 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 (10)] Forceful destruction successful, exit code 0 [2023-02-17 22:13:54,259 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-17 22:13:54,260 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:13:54,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:13:54,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1211116620, now seen corresponding path program 9 times [2023-02-17 22:13:54,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:13:54,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065317376] [2023-02-17 22:13:54,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 22:13:54,262 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-17 22:13:54,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:13:54,263 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-17 22:13:54,267 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-17 22:13:54,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2023-02-17 22:13:54,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 22:13:54,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 76 conjunts are in the unsatisfiable core [2023-02-17 22:13:54,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:13:55,422 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-17 22:13:55,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:14:05,669 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-17 22:14:05,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:14:05,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065317376] [2023-02-17 22:14:05,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065317376] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 22:14:05,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 22:14:05,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 57] total 96 [2023-02-17 22:14:05,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668468836] [2023-02-17 22:14:05,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 22:14:05,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-02-17 22:14:05,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:14:05,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-02-17 22:14:05,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8773, Unknown=0, NotChecked=0, Total=9120 [2023-02-17 22:14:05,673 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-17 22:14:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:14:11,886 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2023-02-17 22:14:11,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-17 22:14:11,886 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-17 22:14:11,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:14:11,887 INFO L225 Difference]: With dead ends: 76 [2023-02-17 22:14:11,887 INFO L226 Difference]: Without dead ends: 70 [2023-02-17 22:14:11,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 110 SyntacticMatches, 20 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2377 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=1274, Invalid=16816, Unknown=0, NotChecked=0, Total=18090 [2023-02-17 22:14:11,890 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 652 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.8s IncrementalHoareTripleChecker+Time [2023-02-17 22:14:11,890 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.8s Time] [2023-02-17 22:14:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-17 22:14:11,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-17 22:14:11,895 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-17 22:14:11,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2023-02-17 22:14:11,895 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 113 [2023-02-17 22:14:11,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:14:11,896 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2023-02-17 22:14:11,896 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-17 22:14:11,896 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2023-02-17 22:14:11,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-02-17 22:14:11,898 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:14:11,898 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:14:11,907 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-17 22:14:12,107 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-17 22:14:12,107 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:14:12,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:14:12,107 INFO L85 PathProgramCache]: Analyzing trace with hash 685850484, now seen corresponding path program 10 times [2023-02-17 22:14:12,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:14:12,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083555815] [2023-02-17 22:14:12,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 22:14:12,108 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-17 22:14:12,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:14:12,109 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-17 22:14:12,111 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-17 22:14:12,204 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 22:14:12,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 22:14:12,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 84 conjunts are in the unsatisfiable core [2023-02-17 22:14:12,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:14:13,355 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-17 22:14:13,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:14:25,947 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-17 22:14:25,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:14:25,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083555815] [2023-02-17 22:14:25,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083555815] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 22:14:25,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 22:14:25,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 63] total 106 [2023-02-17 22:14:25,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774334947] [2023-02-17 22:14:25,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 22:14:25,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2023-02-17 22:14:25,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:14:25,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2023-02-17 22:14:25,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=10745, Unknown=0, NotChecked=0, Total=11130 [2023-02-17 22:14:25,950 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-17 22:14:33,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:14:33,448 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2023-02-17 22:14:33,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-02-17 22:14:33,448 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-17 22:14:33,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:14:33,449 INFO L225 Difference]: With dead ends: 82 [2023-02-17 22:14:33,450 INFO L226 Difference]: Without dead ends: 76 [2023-02-17 22:14:33,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 122 SyntacticMatches, 22 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2900 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=1494, Invalid=20558, Unknown=0, NotChecked=0, Total=22052 [2023-02-17 22:14:33,453 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 594 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s 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.3s IncrementalHoareTripleChecker+Time [2023-02-17 22:14:33,453 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.3s Time] [2023-02-17 22:14:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-17 22:14:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-17 22:14:33,458 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-17 22:14:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2023-02-17 22:14:33,458 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 125 [2023-02-17 22:14:33,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:14:33,459 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2023-02-17 22:14:33,459 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-17 22:14:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2023-02-17 22:14:33,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-02-17 22:14:33,461 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:14:33,461 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:14:33,471 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-17 22:14:33,670 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-17 22:14:33,671 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:14:33,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:14:33,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2059891916, now seen corresponding path program 11 times [2023-02-17 22:14:33,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:14:33,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019582424] [2023-02-17 22:14:33,672 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 22:14:33,672 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-17 22:14:33,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:14:33,673 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-17 22:14:33,674 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-17 22:14:33,845 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2023-02-17 22:14:33,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 22:14:33,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 92 conjunts are in the unsatisfiable core [2023-02-17 22:14:33,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:14:35,299 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-17 22:14:35,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:14:50,809 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-17 22:14:50,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:14:50,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019582424] [2023-02-17 22:14:50,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019582424] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 22:14:50,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 22:14:50,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 69] total 116 [2023-02-17 22:14:50,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116462586] [2023-02-17 22:14:50,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 22:14:50,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2023-02-17 22:14:50,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:14:50,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2023-02-17 22:14:50,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=12917, Unknown=0, NotChecked=0, Total=13340 [2023-02-17 22:14:50,813 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-17 22:15:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:15:00,033 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2023-02-17 22:15:00,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-02-17 22:15:00,034 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-17 22:15:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:15:00,034 INFO L225 Difference]: With dead ends: 88 [2023-02-17 22:15:00,035 INFO L226 Difference]: Without dead ends: 82 [2023-02-17 22:15:00,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 134 SyntacticMatches, 24 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3475 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=1730, Invalid=24676, Unknown=0, NotChecked=0, Total=26406 [2023-02-17 22:15:00,037 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 834 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 2810 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s 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-17 22:15:00,037 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-17 22:15:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-17 22:15:00,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-02-17 22:15:00,041 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-17 22:15:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2023-02-17 22:15:00,042 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 137 [2023-02-17 22:15:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:15:00,042 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2023-02-17 22:15:00,043 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-17 22:15:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2023-02-17 22:15:00,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-02-17 22:15:00,044 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:15:00,045 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:15:00,057 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-17 22:15:00,254 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-17 22:15:00,254 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:15:00,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:15:00,255 INFO L85 PathProgramCache]: Analyzing trace with hash -706365708, now seen corresponding path program 12 times [2023-02-17 22:15:00,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:15:00,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325836665] [2023-02-17 22:15:00,255 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 22:15:00,255 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-17 22:15:00,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:15:00,257 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-17 22:15:00,257 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-17 22:15:00,435 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2023-02-17 22:15:00,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 22:15:00,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 100 conjunts are in the unsatisfiable core [2023-02-17 22:15:00,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:15:02,152 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-17 22:15:02,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:15:21,120 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-17 22:15:21,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:15:21,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325836665] [2023-02-17 22:15:21,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325836665] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 22:15:21,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 22:15:21,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 75] total 126 [2023-02-17 22:15:21,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728452934] [2023-02-17 22:15:21,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 22:15:21,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2023-02-17 22:15:21,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:15:21,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2023-02-17 22:15:21,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=15289, Unknown=0, NotChecked=0, Total=15750 [2023-02-17 22:15:21,123 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-17 22:15:32,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:15:32,197 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2023-02-17 22:15:32,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-02-17 22:15:32,198 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-17 22:15:32,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:15:32,199 INFO L225 Difference]: With dead ends: 94 [2023-02-17 22:15:32,199 INFO L226 Difference]: Without dead ends: 88 [2023-02-17 22:15:32,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 146 SyntacticMatches, 26 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=1982, Invalid=29170, Unknown=0, NotChecked=0, Total=31152 [2023-02-17 22:15:32,201 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 356 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 4039 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s 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.9s IncrementalHoareTripleChecker+Time [2023-02-17 22:15:32,201 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.9s Time] [2023-02-17 22:15:32,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-17 22:15:32,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-17 22:15:32,208 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-17 22:15:32,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2023-02-17 22:15:32,209 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 149 [2023-02-17 22:15:32,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:15:32,210 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2023-02-17 22:15:32,210 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-17 22:15:32,210 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2023-02-17 22:15:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-02-17 22:15:32,212 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:15:32,212 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:15:32,224 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 (14)] Ended with exit code 0 [2023-02-17 22:15:32,421 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-17 22:15:32,422 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:15:32,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:15:32,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1677247156, now seen corresponding path program 13 times [2023-02-17 22:15:32,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:15:32,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450407289] [2023-02-17 22:15:32,422 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-17 22:15:32,423 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-17 22:15:32,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:15:32,423 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-17 22:15:32,425 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-17 22:15:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 22:15:32,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 108 conjunts are in the unsatisfiable core [2023-02-17 22:15:32,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:15:34,682 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-17 22:15:34,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:15:57,273 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-17 22:15:57,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:15:57,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450407289] [2023-02-17 22:15:57,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450407289] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 22:15:57,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 22:15:57,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 81] total 136 [2023-02-17 22:15:57,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319647567] [2023-02-17 22:15:57,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 22:15:57,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2023-02-17 22:15:57,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:15:57,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2023-02-17 22:15:57,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=17861, Unknown=0, NotChecked=0, Total=18360 [2023-02-17 22:15:57,276 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-17 22:16:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:16:10,614 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2023-02-17 22:16:10,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-02-17 22:16:10,614 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-17 22:16:10,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:16:10,615 INFO L225 Difference]: With dead ends: 100 [2023-02-17 22:16:10,615 INFO L226 Difference]: Without dead ends: 94 [2023-02-17 22:16:10,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 158 SyntacticMatches, 28 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4781 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=2250, Invalid=34040, Unknown=0, NotChecked=0, Total=36290 [2023-02-17 22:16:10,618 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1464 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 4602 mSolverCounterSat, 704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s 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.9s IncrementalHoareTripleChecker+Time [2023-02-17 22:16:10,618 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.9s Time] [2023-02-17 22:16:10,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-17 22:16:10,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-02-17 22:16:10,622 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-17 22:16:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2023-02-17 22:16:10,623 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 161 [2023-02-17 22:16:10,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:16:10,623 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2023-02-17 22:16:10,624 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-17 22:16:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2023-02-17 22:16:10,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-02-17 22:16:10,625 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:16:10,626 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:16:10,636 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 (15)] Ended with exit code 0 [2023-02-17 22:16:10,836 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-17 22:16:10,836 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:16:10,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:16:10,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1199460748, now seen corresponding path program 14 times [2023-02-17 22:16:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:16:10,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522645737] [2023-02-17 22:16:10,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 22:16:10,837 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-17 22:16:10,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:16:10,840 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-17 22:16:10,842 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-17 22:16:11,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 22:16:11,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 22:16:11,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 116 conjunts are in the unsatisfiable core [2023-02-17 22:16:11,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:16:13,466 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-17 22:16:13,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:16:39,931 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-17 22:16:39,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:16:39,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522645737] [2023-02-17 22:16:39,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522645737] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 22:16:39,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 22:16:39,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 87] total 146 [2023-02-17 22:16:39,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392616810] [2023-02-17 22:16:39,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 22:16:39,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2023-02-17 22:16:39,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:16:39,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2023-02-17 22:16:39,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=20633, Unknown=0, NotChecked=0, Total=21170 [2023-02-17 22:16:39,935 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-17 22:16:55,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:16:55,322 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2023-02-17 22:16:55,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-02-17 22:16:55,323 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-17 22:16:55,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:16:55,324 INFO L225 Difference]: With dead ends: 106 [2023-02-17 22:16:55,324 INFO L226 Difference]: Without dead ends: 100 [2023-02-17 22:16:55,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 170 SyntacticMatches, 30 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=2534, Invalid=39286, Unknown=0, NotChecked=0, Total=41820 [2023-02-17 22:16:55,327 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 644 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 5040 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s 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.7s IncrementalHoareTripleChecker+Time [2023-02-17 22:16:55,327 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.7s Time] [2023-02-17 22:16:55,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-17 22:16:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-02-17 22:16:55,330 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-17 22:16:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2023-02-17 22:16:55,331 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 173 [2023-02-17 22:16:55,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:16:55,332 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2023-02-17 22:16:55,332 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-17 22:16:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2023-02-17 22:16:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-02-17 22:16:55,333 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:16:55,333 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:16:55,341 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-17 22:16:55,534 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-17 22:16:55,534 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:16:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:16:55,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1668253132, now seen corresponding path program 15 times [2023-02-17 22:16:55,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:16:55,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997323498] [2023-02-17 22:16:55,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 22:16:55,535 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-17 22:16:55,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:16:55,536 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-17 22:16:55,537 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-17 22:16:55,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2023-02-17 22:16:55,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 22:16:55,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 124 conjunts are in the unsatisfiable core [2023-02-17 22:16:55,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 22:16:58,644 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-17 22:16:58,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 22:17:29,217 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-17 22:17:29,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 22:17:29,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997323498] [2023-02-17 22:17:29,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997323498] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 22:17:29,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 22:17:29,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 93] total 156 [2023-02-17 22:17:29,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247259941] [2023-02-17 22:17:29,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 22:17:29,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 156 states [2023-02-17 22:17:29,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 22:17:29,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2023-02-17 22:17:29,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=23605, Unknown=0, NotChecked=0, Total=24180 [2023-02-17 22:17:29,221 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-17 22:17:47,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 22:17:47,248 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2023-02-17 22:17:47,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-02-17 22:17:47,249 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-17 22:17:47,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 22:17:47,250 INFO L225 Difference]: With dead ends: 112 [2023-02-17 22:17:47,250 INFO L226 Difference]: Without dead ends: 106 [2023-02-17 22:17:47,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 182 SyntacticMatches, 32 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6295 ImplicationChecksByTransitivity, 42.0s TimeCoverageRelationStatistics Valid=2834, Invalid=44908, Unknown=0, NotChecked=0, Total=47742 [2023-02-17 22:17:47,254 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1432 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 5925 mSolverCounterSat, 683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s 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.9s IncrementalHoareTripleChecker+Time [2023-02-17 22:17:47,254 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.9s Time] [2023-02-17 22:17:47,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-17 22:17:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-17 22:17:47,258 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-17 22:17:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2023-02-17 22:17:47,259 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 185 [2023-02-17 22:17:47,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 22:17:47,260 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2023-02-17 22:17:47,260 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-17 22:17:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2023-02-17 22:17:47,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-02-17 22:17:47,261 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 22:17:47,262 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 22:17:47,273 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-17 22:17:47,469 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-17 22:17:47,469 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 22:17:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 22:17:47,470 INFO L85 PathProgramCache]: Analyzing trace with hash 422913524, now seen corresponding path program 16 times [2023-02-17 22:17:47,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 22:17:47,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238419587] [2023-02-17 22:17:47,470 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 22:17:47,470 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-17 22:17:47,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 22:17:47,471 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-17 22:17:47,472 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-17 22:17:47,752 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 22:17:47,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-17 22:17:47,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 22:17:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 22:17:47,902 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-17 22:17:47,902 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 22:17:47,903 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 22:17:47,919 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-17 22:17:48,116 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-17 22:17:48,120 INFO L445 BasicCegarLoop]: Path program histogram: [16, 1] [2023-02-17 22:17:48,123 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 22:17:48,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 10:17:48 BoogieIcfgContainer [2023-02-17 22:17:48,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 22:17:48,169 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 22:17:48,169 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 22:17:48,169 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 22:17:48,169 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:13:05" (3/4) ... [2023-02-17 22:17:48,170 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-17 22:17:48,225 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 22:17:48,225 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 22:17:48,225 INFO L158 Benchmark]: Toolchain (without parser) took 283382.60ms. Allocated memory was 71.3MB in the beginning and 570.4MB in the end (delta: 499.1MB). Free memory was 48.5MB in the beginning and 246.7MB in the end (delta: -198.3MB). Peak memory consumption was 302.9MB. Max. memory is 16.1GB. [2023-02-17 22:17:48,226 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory was 29.0MB in the beginning and 28.9MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 22:17:48,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.84ms. Allocated memory is still 71.3MB. Free memory was 48.4MB in the beginning and 38.2MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 22:17:48,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.84ms. Allocated memory is still 71.3MB. Free memory was 38.0MB in the beginning and 36.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 22:17:48,226 INFO L158 Benchmark]: Boogie Preprocessor took 32.40ms. Allocated memory is still 71.3MB. Free memory was 36.6MB in the beginning and 35.6MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 22:17:48,227 INFO L158 Benchmark]: RCFGBuilder took 332.25ms. Allocated memory is still 71.3MB. Free memory was 35.4MB in the beginning and 45.6MB in the end (delta: -10.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-17 22:17:48,227 INFO L158 Benchmark]: TraceAbstraction took 282750.96ms. Allocated memory was 71.3MB in the beginning and 570.4MB in the end (delta: 499.1MB). Free memory was 44.8MB in the beginning and 252.0MB in the end (delta: -207.2MB). Peak memory consumption was 295.0MB. Max. memory is 16.1GB. [2023-02-17 22:17:48,227 INFO L158 Benchmark]: Witness Printer took 56.42ms. Allocated memory is still 570.4MB. Free memory was 252.0MB in the beginning and 246.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 22:17:48,229 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory was 29.0MB in the beginning and 28.9MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.84ms. Allocated memory is still 71.3MB. Free memory was 48.4MB in the beginning and 38.2MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.84ms. Allocated memory is still 71.3MB. Free memory was 38.0MB in the beginning and 36.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.40ms. Allocated memory is still 71.3MB. Free memory was 36.6MB in the beginning and 35.6MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 332.25ms. Allocated memory is still 71.3MB. Free memory was 35.4MB in the beginning and 45.6MB in the end (delta: -10.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 282750.96ms. Allocated memory was 71.3MB in the beginning and 570.4MB in the end (delta: 499.1MB). Free memory was 44.8MB in the beginning and 252.0MB in the end (delta: -207.2MB). Peak memory consumption was 295.0MB. Max. memory is 16.1GB. * Witness Printer took 56.42ms. Allocated memory is still 570.4MB. Free memory was 252.0MB in the beginning and 246.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 36]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] int n = __VERIFIER_nondet_int(); [L28] COND FALSE !(n < 1) VAL [n=32] [L31] CALL, EXPR hanoi(n) VAL [\old(n)=32] [L19] COND FALSE !(n == 1) VAL [\old(n)=32, n=32] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=31] [L19] COND FALSE !(n == 1) VAL [\old(n)=31, n=31] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=30] [L19] COND FALSE !(n == 1) VAL [\old(n)=30, n=30] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=29] [L19] COND FALSE !(n == 1) VAL [\old(n)=29, n=29] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=28] [L19] COND FALSE !(n == 1) VAL [\old(n)=28, n=28] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=27] [L19] COND FALSE !(n == 1) VAL [\old(n)=27, n=27] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=26] [L19] COND FALSE !(n == 1) VAL [\old(n)=26, n=26] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=25] [L19] COND FALSE !(n == 1) VAL [\old(n)=25, n=25] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=24] [L19] COND FALSE !(n == 1) VAL [\old(n)=24, n=24] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=23] [L19] COND FALSE !(n == 1) VAL [\old(n)=23, n=23] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=22] [L19] COND FALSE !(n == 1) VAL [\old(n)=22, n=22] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=21] [L19] COND FALSE !(n == 1) VAL [\old(n)=21, n=21] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=20] [L19] COND FALSE !(n == 1) VAL [\old(n)=20, n=20] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=19] [L19] COND FALSE !(n == 1) VAL [\old(n)=19, n=19] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=18] [L19] COND FALSE !(n == 1) VAL [\old(n)=18, n=18] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=17] [L19] COND FALSE !(n == 1) VAL [\old(n)=17, n=17] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=16] [L19] COND FALSE !(n == 1) VAL [\old(n)=16, n=16] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=15] [L19] COND FALSE !(n == 1) VAL [\old(n)=15, n=15] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=14] [L19] COND FALSE !(n == 1) VAL [\old(n)=14, n=14] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=13] [L19] COND FALSE !(n == 1) VAL [\old(n)=13, n=13] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=12] [L19] COND FALSE !(n == 1) VAL [\old(n)=12, n=12] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=11] [L19] COND FALSE !(n == 1) VAL [\old(n)=11, n=11] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=10] [L19] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=9] [L19] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=2, hanoi(n-1)=1, n=2] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=3, hanoi(n-1)=3, n=3] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=4, hanoi(n-1)=7, n=4] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=5, hanoi(n-1)=15, n=5] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=6, hanoi(n-1)=31, n=6] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=7, hanoi(n-1)=63, n=7] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=8, hanoi(n-1)=127, n=8] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=9, hanoi(n-1)=255, n=9] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=10, hanoi(n-1)=511, n=10] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=11, hanoi(n-1)=1023, n=11] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=12, hanoi(n-1)=2047, n=12] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=13, hanoi(n-1)=4095, n=13] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=14, hanoi(n-1)=8191, n=14] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=15, hanoi(n-1)=16383, n=15] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=16, hanoi(n-1)=32767, n=16] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=17, hanoi(n-1)=65535, n=17] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=18, hanoi(n-1)=131071, n=18] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=19, hanoi(n-1)=262143, n=19] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=20, hanoi(n-1)=524287, n=20] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=21, hanoi(n-1)=1048575, n=21] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=22, hanoi(n-1)=2097151, n=22] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=23, hanoi(n-1)=4194303, n=23] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=24, hanoi(n-1)=8388607, n=24] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=25, hanoi(n-1)=16777215, n=25] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=26, hanoi(n-1)=33554431, n=26] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=27, hanoi(n-1)=67108863, n=27] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=28, hanoi(n-1)=134217727, n=28] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=29, hanoi(n-1)=268435455, n=29] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=30, hanoi(n-1)=536870911, n=30] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=31, hanoi(n-1)=1073741823, n=31] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=32, hanoi(n-1)=2147483647, n=32] [L22] return 2 * (hanoi(n-1)) + 1; [L31] RET, EXPR hanoi(n) VAL [hanoi(n)=-1, n=32] [L31] unsigned result = hanoi(n); [L33] COND FALSE !(result+1>0 && result+1 == 1<