./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 e8d55036 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-?-e8d5503-m [2023-02-15 19:22:59,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:22:59,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:22:59,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:22:59,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:22:59,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:22:59,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:22:59,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:22:59,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:22:59,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:22:59,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:22:59,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:22:59,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:22:59,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:22:59,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:22:59,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:22:59,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:22:59,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:22:59,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:22:59,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:22:59,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:22:59,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:22:59,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:22:59,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:22:59,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:22:59,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:22:59,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:22:59,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:22:59,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:22:59,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:22:59,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:22:59,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:22:59,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:22:59,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:22:59,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:22:59,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:22:59,566 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:22:59,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:22:59,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:22:59,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:22:59,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:22:59,569 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:22:59,602 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:22:59,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:22:59,603 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:22:59,603 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:22:59,604 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:22:59,604 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:22:59,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:22:59,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:22:59,605 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:22:59,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:22:59,606 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:22:59,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:22:59,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:22:59,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:22:59,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:22:59,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:22:59,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:22:59,607 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:22:59,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:22:59,608 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:22:59,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:22:59,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:22:59,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:22:59,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:22:59,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:22:59,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:22:59,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:22:59,609 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:22:59,610 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:22:59,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:22:59,610 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:22:59,610 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:22:59,611 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:22:59,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:22:59,611 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:22:59,611 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-15 19:22:59,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:22:59,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:22:59,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:22:59,889 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:22:59,892 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:22:59,893 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-15 19:23:00,972 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:23:01,151 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:23:01,152 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2023-02-15 19:23:01,156 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7de2dd0/bb82ae49ba744b998cf1fa88caa44bc4/FLAG08a05acdc [2023-02-15 19:23:01,170 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7de2dd0/bb82ae49ba744b998cf1fa88caa44bc4 [2023-02-15 19:23:01,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:23:01,173 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:23:01,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:23:01,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:23:01,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:23:01,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:23:01" (1/1) ... [2023-02-15 19:23:01,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b39b815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:01, skipping insertion in model container [2023-02-15 19:23:01,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:23:01" (1/1) ... [2023-02-15 19:23:01,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:23:01,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:23:01,323 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-15 19:23:01,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:23:01,337 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:23:01,347 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-15 19:23:01,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:23:01,357 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:23:01,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:01 WrapperNode [2023-02-15 19:23:01,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:23:01,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:23:01,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:23:01,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:23:01,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:01" (1/1) ... [2023-02-15 19:23:01,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:01" (1/1) ... [2023-02-15 19:23:01,379 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2023-02-15 19:23:01,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:23:01,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:23:01,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:23:01,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:23:01,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:01" (1/1) ... [2023-02-15 19:23:01,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:01" (1/1) ... [2023-02-15 19:23:01,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:01" (1/1) ... [2023-02-15 19:23:01,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:01" (1/1) ... [2023-02-15 19:23:01,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:01" (1/1) ... [2023-02-15 19:23:01,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:01" (1/1) ... [2023-02-15 19:23:01,392 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:01" (1/1) ... [2023-02-15 19:23:01,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:01" (1/1) ... [2023-02-15 19:23:01,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:23:01,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:23:01,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:23:01,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:23:01,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:01" (1/1) ... [2023-02-15 19:23:01,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:23:01,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:23:01,420 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-15 19:23:01,423 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-15 19:23:01,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:23:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2023-02-15 19:23:01,453 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2023-02-15 19:23:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:23:01,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:23:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:23:01,509 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:23:01,511 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:23:01,612 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:23:01,620 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:23:01,620 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-15 19:23:01,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:23:01 BoogieIcfgContainer [2023-02-15 19:23:01,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:23:01,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:23:01,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:23:01,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:23:01,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:23:01" (1/3) ... [2023-02-15 19:23:01,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df34395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:23:01, skipping insertion in model container [2023-02-15 19:23:01,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:01" (2/3) ... [2023-02-15 19:23:01,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df34395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:23:01, skipping insertion in model container [2023-02-15 19:23:01,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:23:01" (3/3) ... [2023-02-15 19:23:01,629 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2023-02-15 19:23:01,643 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:23:01,644 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:23:01,679 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:23:01,684 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;@9ec5515, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:23:01,684 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:23:01,687 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-15 19:23:01,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 19:23:01,692 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:23:01,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:23:01,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:23:01,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:23:01,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2023-02-15 19:23:01,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:23:01,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818509222] [2023-02-15 19:23:01,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:23:01,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:23:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 19:23:01,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 19:23:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 19:23:01,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 19:23:01,816 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 19:23:01,817 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 19:23:01,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:23:01,822 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-02-15 19:23:01,825 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 19:23:01,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 07:23:01 BoogieIcfgContainer [2023-02-15 19:23:01,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 19:23:01,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 19:23:01,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 19:23:01,839 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 19:23:01,840 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:23:01" (3/4) ... [2023-02-15 19:23:01,843 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 19:23:01,844 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 19:23:01,845 INFO L158 Benchmark]: Toolchain (without parser) took 670.97ms. Allocated memory was 111.1MB in the beginning and 140.5MB in the end (delta: 29.4MB). Free memory was 61.0MB in the beginning and 97.2MB in the end (delta: -36.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 19:23:01,845 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 19:23:01,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.88ms. Allocated memory is still 111.1MB. Free memory was 61.0MB in the beginning and 51.1MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 19:23:01,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.31ms. Allocated memory is still 111.1MB. Free memory was 51.1MB in the beginning and 49.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 19:23:01,847 INFO L158 Benchmark]: Boogie Preprocessor took 14.28ms. Allocated memory is still 111.1MB. Free memory was 49.7MB in the beginning and 48.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 19:23:01,847 INFO L158 Benchmark]: RCFGBuilder took 226.83ms. Allocated memory was 111.1MB in the beginning and 140.5MB in the end (delta: 29.4MB). Free memory was 48.7MB in the beginning and 111.9MB in the end (delta: -63.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 19:23:01,848 INFO L158 Benchmark]: TraceAbstraction took 215.13ms. Allocated memory is still 140.5MB. Free memory was 111.2MB in the beginning and 97.9MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 19:23:01,848 INFO L158 Benchmark]: Witness Printer took 4.70ms. Allocated memory is still 140.5MB. Free memory is still 97.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 19:23:01,851 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.17ms. Allocated memory is still 111.1MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.88ms. Allocated memory is still 111.1MB. Free memory was 61.0MB in the beginning and 51.1MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.31ms. Allocated memory is still 111.1MB. Free memory was 51.1MB in the beginning and 49.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.28ms. Allocated memory is still 111.1MB. Free memory was 49.7MB in the beginning and 48.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 226.83ms. Allocated memory was 111.1MB in the beginning and 140.5MB in the end (delta: 29.4MB). Free memory was 48.7MB in the beginning and 111.9MB in the end (delta: -63.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 215.13ms. Allocated memory is still 140.5MB. Free memory was 111.2MB in the beginning and 97.9MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 4.70ms. Allocated memory is still 140.5MB. Free memory is still 97.2MB. 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-15 19:23:04,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:23:04,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:23:04,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:23:04,422 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:23:04,423 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:23:04,424 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-15 19:23:05,559 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:23:05,760 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:23:05,761 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2023-02-15 19:23:05,767 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e1ef126a/2b2ad6f8440940d89952b8333f02a09d/FLAG23d74e94e [2023-02-15 19:23:05,777 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e1ef126a/2b2ad6f8440940d89952b8333f02a09d [2023-02-15 19:23:05,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:23:05,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:23:05,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:23:05,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:23:05,784 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:23:05,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:23:05" (1/1) ... [2023-02-15 19:23:05,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bed8b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:05, skipping insertion in model container [2023-02-15 19:23:05,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:23:05" (1/1) ... [2023-02-15 19:23:05,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:23:05,801 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:23:05,906 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-15 19:23:05,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:23:05,918 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:23:05,931 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-15 19:23:05,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:23:05,943 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:23:05,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:05 WrapperNode [2023-02-15 19:23:05,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:23:05,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:23:05,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:23:05,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:23:05,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:05" (1/1) ... [2023-02-15 19:23:05,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:05" (1/1) ... [2023-02-15 19:23:05,967 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2023-02-15 19:23:05,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:23:05,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:23:05,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:23:05,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:23:05,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:05" (1/1) ... [2023-02-15 19:23:05,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:05" (1/1) ... [2023-02-15 19:23:05,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:05" (1/1) ... [2023-02-15 19:23:05,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:05" (1/1) ... [2023-02-15 19:23:05,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:05" (1/1) ... [2023-02-15 19:23:05,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:05" (1/1) ... [2023-02-15 19:23:05,992 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:05" (1/1) ... [2023-02-15 19:23:05,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:05" (1/1) ... [2023-02-15 19:23:05,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:23:05,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:23:05,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:23:05,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:23:05,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:05" (1/1) ... [2023-02-15 19:23:06,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:23:06,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:23:06,026 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-15 19:23:06,033 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-15 19:23:06,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:23:06,061 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2023-02-15 19:23:06,061 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2023-02-15 19:23:06,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:23:06,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:23:06,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 19:23:06,113 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:23:06,114 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:23:06,207 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:23:06,212 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:23:06,212 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-15 19:23:06,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:23:06 BoogieIcfgContainer [2023-02-15 19:23:06,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:23:06,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:23:06,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:23:06,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:23:06,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:23:05" (1/3) ... [2023-02-15 19:23:06,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556b4063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:23:06, skipping insertion in model container [2023-02-15 19:23:06,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:23:05" (2/3) ... [2023-02-15 19:23:06,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556b4063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:23:06, skipping insertion in model container [2023-02-15 19:23:06,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:23:06" (3/3) ... [2023-02-15 19:23:06,220 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2023-02-15 19:23:06,233 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:23:06,233 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:23:06,268 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:23:06,273 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;@1e0dd3fc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:23:06,274 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:23:06,277 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-15 19:23:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 19:23:06,283 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:23:06,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:23:06,284 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:23:06,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:23:06,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2023-02-15 19:23:06,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:23:06,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411361191] [2023-02-15 19:23:06,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:23:06,299 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-15 19:23:06,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:23:06,305 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-15 19:23:06,312 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-15 19:23:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:23:06,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 19:23:06,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:23:06,594 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-15 19:23:06,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:23:06,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:23:06,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411361191] [2023-02-15 19:23:06,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411361191] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:23:06,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:23:06,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 19:23:06,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220682205] [2023-02-15 19:23:06,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:23:06,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 19:23:06,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:23:06,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 19:23:06,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:23:06,640 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-15 19:23:06,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:23:06,766 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-02-15 19:23:06,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 19:23:06,770 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-15 19:23:06,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:23:06,779 INFO L225 Difference]: With dead ends: 32 [2023-02-15 19:23:06,780 INFO L226 Difference]: Without dead ends: 16 [2023-02-15 19:23:06,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 19:23:06,787 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-15 19:23:06,787 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-15 19:23:06,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-02-15 19:23:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-02-15 19:23:06,818 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-15 19:23:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-02-15 19:23:06,821 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2023-02-15 19:23:06,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:23:06,821 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-02-15 19:23:06,822 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-15 19:23:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2023-02-15 19:23:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 19:23:06,824 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:23:06,824 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:23:06,833 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-15 19:23:07,032 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-15 19:23:07,033 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:23:07,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:23:07,034 INFO L85 PathProgramCache]: Analyzing trace with hash -2053638732, now seen corresponding path program 1 times [2023-02-15 19:23:07,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:23:07,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258977437] [2023-02-15 19:23:07,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:23:07,035 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-15 19:23:07,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:23:07,036 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-15 19:23:07,037 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-15 19:23:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:23:07,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 19:23:07,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:23:07,213 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-15 19:23:07,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:23:07,731 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-15 19:23:07,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:23:07,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258977437] [2023-02-15 19:23:07,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258977437] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:23:07,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:23:07,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-02-15 19:23:07,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565112539] [2023-02-15 19:23:07,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:23:07,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 19:23:07,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:23:07,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 19:23:07,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-02-15 19:23:07,740 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-15 19:23:08,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:23:08,087 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-02-15 19:23:08,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 19:23:08,088 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-15 19:23:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:23:08,089 INFO L225 Difference]: With dead ends: 28 [2023-02-15 19:23:08,089 INFO L226 Difference]: Without dead ends: 22 [2023-02-15 19:23:08,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2023-02-15 19:23:08,091 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-15 19:23:08,091 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-15 19:23:08,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-15 19:23:08,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-15 19:23:08,099 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-15 19:23:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2023-02-15 19:23:08,102 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2023-02-15 19:23:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:23:08,102 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2023-02-15 19:23:08,103 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-15 19:23:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2023-02-15 19:23:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 19:23:08,104 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:23:08,104 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:23:08,115 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-15 19:23:08,305 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-15 19:23:08,306 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:23:08,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:23:08,307 INFO L85 PathProgramCache]: Analyzing trace with hash -491101836, now seen corresponding path program 2 times [2023-02-15 19:23:08,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:23:08,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64842977] [2023-02-15 19:23:08,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:23:08,310 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-15 19:23:08,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:23:08,312 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-15 19:23:08,314 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-15 19:23:08,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:23:08,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:23:08,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 19:23:08,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:23:08,607 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-15 19:23:08,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:23:09,714 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-15 19:23:09,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:23:09,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64842977] [2023-02-15 19:23:09,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64842977] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:23:09,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:23:09,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2023-02-15 19:23:09,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902937268] [2023-02-15 19:23:09,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:23:09,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 19:23:09,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:23:09,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 19:23:09,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2023-02-15 19:23:09,717 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-15 19:23:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:23:10,232 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2023-02-15 19:23:10,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 19:23:10,235 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-15 19:23:10,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:23:10,236 INFO L225 Difference]: With dead ends: 34 [2023-02-15 19:23:10,236 INFO L226 Difference]: Without dead ends: 28 [2023-02-15 19:23:10,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332 [2023-02-15 19:23:10,238 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:23:10,238 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.2s Time] [2023-02-15 19:23:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-15 19:23:10,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-15 19:23:10,243 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-15 19:23:10,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2023-02-15 19:23:10,244 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 29 [2023-02-15 19:23:10,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:23:10,244 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2023-02-15 19:23:10,245 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-15 19:23:10,245 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2023-02-15 19:23:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 19:23:10,246 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:23:10,246 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:23:10,259 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-15 19:23:10,454 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-15 19:23:10,455 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:23:10,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:23:10,456 INFO L85 PathProgramCache]: Analyzing trace with hash -492655308, now seen corresponding path program 3 times [2023-02-15 19:23:10,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:23:10,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887916834] [2023-02-15 19:23:10,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 19:23:10,456 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-15 19:23:10,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:23:10,458 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-15 19:23:10,461 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-15 19:23:10,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-15 19:23:10,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:23:10,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 19:23:10,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:23:10,775 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-15 19:23:10,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:23:12,651 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-15 19:23:12,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:23:12,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887916834] [2023-02-15 19:23:12,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887916834] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:23:12,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:23:12,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2023-02-15 19:23:12,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044967794] [2023-02-15 19:23:12,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:23:12,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-15 19:23:12,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:23:12,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-15 19:23:12,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 19:23:12,655 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-15 19:23:13,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:23:13,364 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2023-02-15 19:23:13,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 19:23:13,365 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-15 19:23:13,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:23:13,366 INFO L225 Difference]: With dead ends: 40 [2023-02-15 19:23:13,366 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 19:23:13,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=290, Invalid=2260, Unknown=0, NotChecked=0, Total=2550 [2023-02-15 19:23:13,368 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 62 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:23:13,369 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.3s Time] [2023-02-15 19:23:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 19:23:13,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-02-15 19:23:13,374 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-15 19:23:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2023-02-15 19:23:13,375 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 41 [2023-02-15 19:23:13,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:23:13,376 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2023-02-15 19:23:13,376 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-15 19:23:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2023-02-15 19:23:13,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 19:23:13,378 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:23:13,378 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:23:13,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 19:23:13,585 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-15 19:23:13,585 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:23:13,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:23:13,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1906255628, now seen corresponding path program 4 times [2023-02-15 19:23:13,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:23:13,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554704973] [2023-02-15 19:23:13,587 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 19:23:13,587 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-15 19:23:13,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:23:13,588 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-15 19:23:13,591 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-15 19:23:13,624 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 19:23:13,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:23:13,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 19:23:13,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:23:13,951 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-15 19:23:13,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:23:16,559 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-15 19:23:16,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:23:16,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554704973] [2023-02-15 19:23:16,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554704973] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:23:16,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:23:16,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 46 [2023-02-15 19:23:16,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084030669] [2023-02-15 19:23:16,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:23:16,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 19:23:16,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:23:16,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 19:23:16,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2023-02-15 19:23:16,563 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-15 19:23:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:23:17,592 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2023-02-15 19:23:17,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 19:23:17,603 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-15 19:23:17,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:23:17,605 INFO L225 Difference]: With dead ends: 46 [2023-02-15 19:23:17,606 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 19:23:17,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=414, Invalid=3746, Unknown=0, NotChecked=0, Total=4160 [2023-02-15 19:23:17,609 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 114 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2023-02-15 19:23:17,609 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.4s Time] [2023-02-15 19:23:17,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 19:23:17,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-02-15 19:23:17,620 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-15 19:23:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2023-02-15 19:23:17,623 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 53 [2023-02-15 19:23:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:23:17,624 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2023-02-15 19:23:17,624 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-15 19:23:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2023-02-15 19:23:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 19:23:17,627 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:23:17,627 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:23:17,636 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 (6)] Forceful destruction successful, exit code 0 [2023-02-15 19:23:17,829 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-15 19:23:17,829 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:23:17,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:23:17,830 INFO L85 PathProgramCache]: Analyzing trace with hash 788849844, now seen corresponding path program 5 times [2023-02-15 19:23:17,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:23:17,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735537668] [2023-02-15 19:23:17,830 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 19:23:17,830 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-15 19:23:17,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:23:17,831 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-15 19:23:17,832 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-15 19:23:17,878 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-02-15 19:23:17,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:23:17,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 19:23:17,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:23:18,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-15 19:23:18,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:23:21,985 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-15 19:23:21,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:23:21,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735537668] [2023-02-15 19:23:21,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735537668] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:23:21,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:23:21,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2023-02-15 19:23:21,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015066028] [2023-02-15 19:23:21,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:23:21,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-15 19:23:21,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:23:21,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-15 19:23:21,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2023-02-15 19:23:21,989 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-15 19:23:23,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:23:23,290 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2023-02-15 19:23:23,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 19:23:23,291 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-15 19:23:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:23:23,291 INFO L225 Difference]: With dead ends: 52 [2023-02-15 19:23:23,292 INFO L226 Difference]: Without dead ends: 46 [2023-02-15 19:23:23,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=554, Invalid=5608, Unknown=0, NotChecked=0, Total=6162 [2023-02-15 19:23:23,294 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 138 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:23:23,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 443 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 19:23:23,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-15 19:23:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-02-15 19:23:23,298 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-15 19:23:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2023-02-15 19:23:23,299 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 65 [2023-02-15 19:23:23,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:23:23,299 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2023-02-15 19:23:23,299 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-15 19:23:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2023-02-15 19:23:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-15 19:23:23,300 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:23:23,300 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:23:23,309 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-15 19:23:23,508 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-15 19:23:23,509 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:23:23,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:23:23,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1302253684, now seen corresponding path program 6 times [2023-02-15 19:23:23,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:23:23,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187313214] [2023-02-15 19:23:23,511 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 19:23:23,511 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-15 19:23:23,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:23:23,512 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-15 19:23:23,513 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-15 19:23:23,568 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2023-02-15 19:23:23,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:23:23,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-15 19:23:23,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:23:24,087 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-15 19:23:24,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:23:28,879 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-15 19:23:28,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:23:28,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187313214] [2023-02-15 19:23:28,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187313214] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:23:28,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:23:28,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39] total 66 [2023-02-15 19:23:28,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349543861] [2023-02-15 19:23:28,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:23:28,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-02-15 19:23:28,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:23:28,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-02-15 19:23:28,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4057, Unknown=0, NotChecked=0, Total=4290 [2023-02-15 19:23:28,884 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-15 19:23:30,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:23:30,676 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2023-02-15 19:23:30,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 19:23:30,686 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-15 19:23:30,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:23:30,691 INFO L225 Difference]: With dead ends: 58 [2023-02-15 19:23:30,691 INFO L226 Difference]: Without dead ends: 52 [2023-02-15 19:23:30,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=710, Invalid=7846, Unknown=0, NotChecked=0, Total=8556 [2023-02-15 19:23:30,694 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 84 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 19:23:30,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 556 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 19:23:30,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-15 19:23:30,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-02-15 19:23:30,700 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-15 19:23:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2023-02-15 19:23:30,701 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 77 [2023-02-15 19:23:30,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:23:30,702 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2023-02-15 19:23:30,702 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-15 19:23:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2023-02-15 19:23:30,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-02-15 19:23:30,703 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:23:30,704 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:23:30,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-02-15 19:23:30,911 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-15 19:23:30,912 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:23:30,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:23:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1287742412, now seen corresponding path program 7 times [2023-02-15 19:23:30,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:23:30,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977598893] [2023-02-15 19:23:30,913 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 19:23:30,913 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-15 19:23:30,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:23:30,914 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-15 19:23:30,914 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-15 19:23:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:23:30,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-15 19:23:30,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:23:31,648 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-15 19:23:31,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:23:37,777 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-15 19:23:37,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:23:37,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977598893] [2023-02-15 19:23:37,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977598893] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:23:37,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:23:37,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 45] total 76 [2023-02-15 19:23:37,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410266407] [2023-02-15 19:23:37,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:23:37,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2023-02-15 19:23:37,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:23:37,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2023-02-15 19:23:37,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=5429, Unknown=0, NotChecked=0, Total=5700 [2023-02-15 19:23:37,782 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-15 19:23:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:23:39,865 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2023-02-15 19:23:39,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-15 19:23:39,865 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-15 19:23:39,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:23:39,866 INFO L225 Difference]: With dead ends: 64 [2023-02-15 19:23:39,866 INFO L226 Difference]: Without dead ends: 58 [2023-02-15 19:23:39,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=882, Invalid=10460, Unknown=0, NotChecked=0, Total=11342 [2023-02-15 19:23:39,869 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 246 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 19:23:39,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 853 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 19:23:39,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-15 19:23:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-02-15 19:23:39,875 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-15 19:23:39,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2023-02-15 19:23:39,875 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 89 [2023-02-15 19:23:39,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:23:39,876 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2023-02-15 19:23:39,876 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-15 19:23:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2023-02-15 19:23:39,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-15 19:23:39,878 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:23:39,878 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:23:39,888 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-15 19:23:40,085 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-15 19:23:40,085 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:23:40,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:23:40,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1760839668, now seen corresponding path program 8 times [2023-02-15 19:23:40,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:23:40,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859252656] [2023-02-15 19:23:40,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:23:40,086 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-15 19:23:40,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:23:40,087 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-15 19:23:40,090 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-15 19:23:40,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:23:40,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:23:40,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 68 conjunts are in the unsatisfiable core [2023-02-15 19:23:40,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:23:40,995 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-15 19:23:40,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:23:48,664 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-15 19:23:48,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:23:48,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859252656] [2023-02-15 19:23:48,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859252656] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:23:48,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:23:48,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 51] total 86 [2023-02-15 19:23:48,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158018444] [2023-02-15 19:23:48,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:23:48,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2023-02-15 19:23:48,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:23:48,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2023-02-15 19:23:48,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=7001, Unknown=0, NotChecked=0, Total=7310 [2023-02-15 19:23:48,669 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-15 19:23:51,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:23:51,291 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2023-02-15 19:23:51,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-15 19:23:51,291 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-15 19:23:51,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:23:51,292 INFO L225 Difference]: With dead ends: 70 [2023-02-15 19:23:51,292 INFO L226 Difference]: Without dead ends: 64 [2023-02-15 19:23:51,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1906 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1070, Invalid=13450, Unknown=0, NotChecked=0, Total=14520 [2023-02-15 19:23:51,295 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 516 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:23:51,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 890 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 19:23:51,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-15 19:23:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-02-15 19:23:51,301 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-15 19:23:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2023-02-15 19:23:51,302 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 101 [2023-02-15 19:23:51,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:23:51,302 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2023-02-15 19:23:51,303 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-15 19:23:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2023-02-15 19:23:51,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-02-15 19:23:51,304 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:23:51,304 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:23:51,312 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-15 19:23:51,509 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-15 19:23:51,509 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:23:51,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:23:51,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1211116620, now seen corresponding path program 9 times [2023-02-15 19:23:51,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:23:51,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792020370] [2023-02-15 19:23:51,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 19:23:51,510 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-15 19:23:51,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:23:51,511 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-15 19:23:51,512 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-15 19:23:51,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2023-02-15 19:23:51,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:23:51,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 76 conjunts are in the unsatisfiable core [2023-02-15 19:23:51,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:23:52,507 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-15 19:23:52,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:24:02,107 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-15 19:24:02,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:24:02,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792020370] [2023-02-15 19:24:02,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792020370] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:24:02,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:24:02,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 57] total 96 [2023-02-15 19:24:02,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619215571] [2023-02-15 19:24:02,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:24:02,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-02-15 19:24:02,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:24:02,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-02-15 19:24:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8773, Unknown=0, NotChecked=0, Total=9120 [2023-02-15 19:24:02,111 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-15 19:24:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:24:05,212 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2023-02-15 19:24:05,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-15 19:24:05,213 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-15 19:24:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:24:05,213 INFO L225 Difference]: With dead ends: 76 [2023-02-15 19:24:05,214 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 19:24:05,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2377 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1274, Invalid=16816, Unknown=0, NotChecked=0, Total=18090 [2023-02-15 19:24:05,216 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 652 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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, 1.3s IncrementalHoareTripleChecker+Time [2023-02-15 19:24:05,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1113 Invalid, 2540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 2235 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-15 19:24:05,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 19:24:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-15 19:24:05,221 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-15 19:24:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2023-02-15 19:24:05,222 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 113 [2023-02-15 19:24:05,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:24:05,222 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2023-02-15 19:24:05,223 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-15 19:24:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2023-02-15 19:24:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-02-15 19:24:05,224 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:24:05,224 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:24:05,232 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-15 19:24:05,429 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-15 19:24:05,429 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:24:05,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:24:05,429 INFO L85 PathProgramCache]: Analyzing trace with hash 685850484, now seen corresponding path program 10 times [2023-02-15 19:24:05,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:24:05,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483569267] [2023-02-15 19:24:05,430 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 19:24:05,430 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-15 19:24:05,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:24:05,431 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-15 19:24:05,432 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-15 19:24:05,526 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 19:24:05,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:24:05,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 84 conjunts are in the unsatisfiable core [2023-02-15 19:24:05,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:24:06,596 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-15 19:24:06,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:24:18,309 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-15 19:24:18,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:24:18,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483569267] [2023-02-15 19:24:18,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483569267] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:24:18,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:24:18,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 63] total 106 [2023-02-15 19:24:18,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69835131] [2023-02-15 19:24:18,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:24:18,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2023-02-15 19:24:18,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:24:18,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2023-02-15 19:24:18,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=10745, Unknown=0, NotChecked=0, Total=11130 [2023-02-15 19:24:18,312 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-15 19:24:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:24:21,943 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2023-02-15 19:24:21,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-02-15 19:24:21,944 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-15 19:24:21,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:24:21,945 INFO L225 Difference]: With dead ends: 82 [2023-02-15 19:24:21,945 INFO L226 Difference]: Without dead ends: 76 [2023-02-15 19:24:21,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2900 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1494, Invalid=20558, Unknown=0, NotChecked=0, Total=22052 [2023-02-15 19:24:21,947 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 594 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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, 1.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:24:21,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1401 Invalid, 2857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2582 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-15 19:24:21,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-15 19:24:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-15 19:24:21,953 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-15 19:24:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2023-02-15 19:24:21,954 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 125 [2023-02-15 19:24:21,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:24:21,954 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2023-02-15 19:24:21,954 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-15 19:24:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2023-02-15 19:24:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-02-15 19:24:21,956 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:24:21,956 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:24:21,965 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-15 19:24:22,165 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-15 19:24:22,166 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:24:22,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:24:22,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2059891916, now seen corresponding path program 11 times [2023-02-15 19:24:22,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:24:22,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384622842] [2023-02-15 19:24:22,167 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 19:24:22,167 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-15 19:24:22,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:24:22,168 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-15 19:24:22,168 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-15 19:24:22,309 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2023-02-15 19:24:22,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:24:22,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 92 conjunts are in the unsatisfiable core [2023-02-15 19:24:22,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:24:23,600 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-15 19:24:23,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:24:37,403 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-15 19:24:37,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:24:37,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384622842] [2023-02-15 19:24:37,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384622842] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:24:37,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:24:37,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 69] total 116 [2023-02-15 19:24:37,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9987166] [2023-02-15 19:24:37,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:24:37,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2023-02-15 19:24:37,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:24:37,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2023-02-15 19:24:37,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=12917, Unknown=0, NotChecked=0, Total=13340 [2023-02-15 19:24:37,407 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-15 19:24:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:24:41,621 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2023-02-15 19:24:41,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-02-15 19:24:41,622 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-15 19:24:41,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:24:41,623 INFO L225 Difference]: With dead ends: 88 [2023-02-15 19:24:41,623 INFO L226 Difference]: Without dead ends: 82 [2023-02-15 19:24:41,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3475 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1730, Invalid=24676, Unknown=0, NotChecked=0, Total=26406 [2023-02-15 19:24:41,624 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 834 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 2810 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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, 1.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:24:41,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1444 Invalid, 3203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 2810 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-15 19:24:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-15 19:24:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-02-15 19:24:41,630 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-15 19:24:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2023-02-15 19:24:41,630 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 137 [2023-02-15 19:24:41,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:24:41,631 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2023-02-15 19:24:41,631 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-15 19:24:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2023-02-15 19:24:41,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-02-15 19:24:41,633 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:24:41,633 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:24:41,644 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-15 19:24:41,842 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-15 19:24:41,842 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:24:41,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:24:41,843 INFO L85 PathProgramCache]: Analyzing trace with hash -706365708, now seen corresponding path program 12 times [2023-02-15 19:24:41,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:24:41,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656899316] [2023-02-15 19:24:41,843 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 19:24:41,843 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-15 19:24:41,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:24:41,844 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-15 19:24:41,845 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-15 19:24:42,032 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2023-02-15 19:24:42,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:24:42,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 100 conjunts are in the unsatisfiable core [2023-02-15 19:24:42,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:24:43,446 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-15 19:24:43,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:24:59,653 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-15 19:24:59,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:24:59,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656899316] [2023-02-15 19:24:59,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656899316] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:24:59,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:24:59,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 75] total 126 [2023-02-15 19:24:59,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169646096] [2023-02-15 19:24:59,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:24:59,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2023-02-15 19:24:59,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:24:59,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2023-02-15 19:24:59,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=15289, Unknown=0, NotChecked=0, Total=15750 [2023-02-15 19:24:59,657 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-15 19:25:04,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:25:04,559 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2023-02-15 19:25:04,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-02-15 19:25:04,560 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-15 19:25:04,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:25:04,561 INFO L225 Difference]: With dead ends: 94 [2023-02-15 19:25:04,561 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 19:25:04,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1982, Invalid=29170, Unknown=0, NotChecked=0, Total=31152 [2023-02-15 19:25:04,563 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 356 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 4039 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:25:04,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 2050 Invalid, 4190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 4039 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-02-15 19:25:04,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 19:25:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-15 19:25:04,569 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-15 19:25:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2023-02-15 19:25:04,570 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 149 [2023-02-15 19:25:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:25:04,570 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2023-02-15 19:25:04,571 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-15 19:25:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2023-02-15 19:25:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-02-15 19:25:04,573 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:25:04,573 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:25:04,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 19:25:04,783 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-15 19:25:04,783 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:25:04,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:25:04,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1677247156, now seen corresponding path program 13 times [2023-02-15 19:25:04,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:25:04,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47756346] [2023-02-15 19:25:04,784 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 19:25:04,784 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-15 19:25:04,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:25:04,786 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-15 19:25:04,787 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-15 19:25:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:25:04,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 108 conjunts are in the unsatisfiable core [2023-02-15 19:25:04,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:25:06,599 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-15 19:25:06,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:25:25,402 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-15 19:25:25,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:25:25,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47756346] [2023-02-15 19:25:25,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47756346] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:25:25,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:25:25,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 81] total 136 [2023-02-15 19:25:25,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613801871] [2023-02-15 19:25:25,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:25:25,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2023-02-15 19:25:25,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:25:25,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2023-02-15 19:25:25,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=17861, Unknown=0, NotChecked=0, Total=18360 [2023-02-15 19:25:25,405 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-15 19:25:31,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:25:31,145 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2023-02-15 19:25:31,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-02-15 19:25:31,146 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-15 19:25:31,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:25:31,147 INFO L225 Difference]: With dead ends: 100 [2023-02-15 19:25:31,147 INFO L226 Difference]: Without dead ends: 94 [2023-02-15 19:25:31,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4781 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=2250, Invalid=34040, Unknown=0, NotChecked=0, Total=36290 [2023-02-15 19:25:31,149 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1464 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 4602 mSolverCounterSat, 704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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, 2.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:25:31,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 2237 Invalid, 5306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [704 Valid, 4602 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-02-15 19:25:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-15 19:25:31,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-02-15 19:25:31,154 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-15 19:25:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2023-02-15 19:25:31,155 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 161 [2023-02-15 19:25:31,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:25:31,155 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2023-02-15 19:25:31,156 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-15 19:25:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2023-02-15 19:25:31,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-02-15 19:25:31,157 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:25:31,157 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:25:31,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 19:25:31,367 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-15 19:25:31,367 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:25:31,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:25:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1199460748, now seen corresponding path program 14 times [2023-02-15 19:25:31,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:25:31,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677699398] [2023-02-15 19:25:31,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:25:31,368 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-15 19:25:31,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:25:31,369 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-15 19:25:31,384 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-15 19:25:31,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:25:31,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:25:31,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 116 conjunts are in the unsatisfiable core [2023-02-15 19:25:31,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:25:33,374 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-15 19:25:33,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:25:55,113 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-15 19:25:55,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:25:55,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677699398] [2023-02-15 19:25:55,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677699398] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:25:55,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:25:55,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 87] total 146 [2023-02-15 19:25:55,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287859312] [2023-02-15 19:25:55,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:25:55,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2023-02-15 19:25:55,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:25:55,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2023-02-15 19:25:55,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=20633, Unknown=0, NotChecked=0, Total=21170 [2023-02-15 19:25:55,118 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-15 19:26:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:01,525 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2023-02-15 19:26:01,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-02-15 19:26:01,526 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-15 19:26:01,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:01,527 INFO L225 Difference]: With dead ends: 106 [2023-02-15 19:26:01,527 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 19:26:01,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=2534, Invalid=39286, Unknown=0, NotChecked=0, Total=41820 [2023-02-15 19:26:01,530 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 644 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 5040 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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, 2.6s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:01,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 2525 Invalid, 5331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 5040 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-02-15 19:26:01,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 19:26:01,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-02-15 19:26:01,534 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-15 19:26:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2023-02-15 19:26:01,534 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 173 [2023-02-15 19:26:01,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:01,535 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2023-02-15 19:26:01,535 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-15 19:26:01,536 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2023-02-15 19:26:01,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-02-15 19:26:01,537 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:01,537 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:01,545 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-15 19:26:01,741 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-15 19:26:01,741 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:01,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:01,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1668253132, now seen corresponding path program 15 times [2023-02-15 19:26:01,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:26:01,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363153400] [2023-02-15 19:26:01,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 19:26:01,742 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-15 19:26:01,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:26:01,743 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-15 19:26:01,744 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-15 19:26:02,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2023-02-15 19:26:02,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:26:02,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 124 conjunts are in the unsatisfiable core [2023-02-15 19:26:02,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:26:04,021 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-15 19:26:04,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:26:28,811 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-15 19:26:28,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 19:26:28,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363153400] [2023-02-15 19:26:28,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363153400] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:26:28,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:26:28,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 93] total 156 [2023-02-15 19:26:28,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676255305] [2023-02-15 19:26:28,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:26:28,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 156 states [2023-02-15 19:26:28,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 19:26:28,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2023-02-15 19:26:28,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=23605, Unknown=0, NotChecked=0, Total=24180 [2023-02-15 19:26:28,815 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-15 19:26:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:26:36,158 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2023-02-15 19:26:36,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-02-15 19:26:36,159 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-15 19:26:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:26:36,160 INFO L225 Difference]: With dead ends: 112 [2023-02-15 19:26:36,160 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 19:26:36,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6295 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=2834, Invalid=44908, Unknown=0, NotChecked=0, Total=47742 [2023-02-15 19:26:36,164 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1432 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 5925 mSolverCounterSat, 683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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, 3.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:26:36,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 2871 Invalid, 6608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [683 Valid, 5925 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-02-15 19:26:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 19:26:36,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-15 19:26:36,168 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-15 19:26:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2023-02-15 19:26:36,169 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 185 [2023-02-15 19:26:36,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:26:36,169 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2023-02-15 19:26:36,169 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-15 19:26:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2023-02-15 19:26:36,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-02-15 19:26:36,171 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:26:36,171 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:26:36,180 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-15 19:26:36,377 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-15 19:26:36,377 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:26:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:26:36,378 INFO L85 PathProgramCache]: Analyzing trace with hash 422913524, now seen corresponding path program 16 times [2023-02-15 19:26:36,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 19:26:36,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146282738] [2023-02-15 19:26:36,380 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 19:26:36,381 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-15 19:26:36,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 19:26:36,382 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-15 19:26:36,408 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-15 19:26:36,683 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 19:26:36,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 19:26:36,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 19:26:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 19:26:36,825 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 19:26:36,825 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 19:26:36,826 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 19:26:36,841 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 (18)] Ended with exit code 0 [2023-02-15 19:26:37,041 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-15 19:26:37,044 INFO L445 BasicCegarLoop]: Path program histogram: [16, 1] [2023-02-15 19:26:37,047 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 19:26:37,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 07:26:37 BoogieIcfgContainer [2023-02-15 19:26:37,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 19:26:37,111 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 19:26:37,111 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 19:26:37,111 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 19:26:37,112 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:23:06" (3/4) ... [2023-02-15 19:26:37,113 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 19:26:37,163 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 19:26:37,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 19:26:37,163 INFO L158 Benchmark]: Toolchain (without parser) took 211383.16ms. Allocated memory was 69.2MB in the beginning and 176.2MB in the end (delta: 107.0MB). Free memory was 46.2MB in the beginning and 77.0MB in the end (delta: -30.8MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2023-02-15 19:26:37,164 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory is still 33.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 19:26:37,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.54ms. Allocated memory is still 69.2MB. Free memory was 46.0MB in the beginning and 35.9MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 19:26:37,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.38ms. Allocated memory is still 69.2MB. Free memory was 35.9MB in the beginning and 34.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 19:26:37,164 INFO L158 Benchmark]: Boogie Preprocessor took 26.02ms. Allocated memory is still 69.2MB. Free memory was 34.4MB in the beginning and 33.3MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 19:26:37,165 INFO L158 Benchmark]: RCFGBuilder took 219.22ms. Allocated memory is still 69.2MB. Free memory was 33.3MB in the beginning and 42.7MB in the end (delta: -9.5MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2023-02-15 19:26:37,165 INFO L158 Benchmark]: TraceAbstraction took 210895.27ms. Allocated memory was 69.2MB in the beginning and 176.2MB in the end (delta: 107.0MB). Free memory was 41.9MB in the beginning and 82.3MB in the end (delta: -40.3MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2023-02-15 19:26:37,165 INFO L158 Benchmark]: Witness Printer took 52.03ms. Allocated memory is still 176.2MB. Free memory was 82.3MB in the beginning and 77.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-15 19:26:37,167 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 56.6MB. Free memory is still 33.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.54ms. Allocated memory is still 69.2MB. Free memory was 46.0MB in the beginning and 35.9MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.38ms. Allocated memory is still 69.2MB. Free memory was 35.9MB in the beginning and 34.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.02ms. Allocated memory is still 69.2MB. Free memory was 34.4MB in the beginning and 33.3MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 219.22ms. Allocated memory is still 69.2MB. Free memory was 33.3MB in the beginning and 42.7MB in the end (delta: -9.5MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * TraceAbstraction took 210895.27ms. Allocated memory was 69.2MB in the beginning and 176.2MB in the end (delta: 107.0MB). Free memory was 41.9MB in the beginning and 82.3MB in the end (delta: -40.3MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. * Witness Printer took 52.03ms. Allocated memory is still 176.2MB. Free memory was 82.3MB in the beginning and 77.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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<