./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i -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 --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 6499b62d1470f924cb4a1d4c6eb228c557a21b7be97bcd4aa73e963f3e1c7410 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:58:24,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:58:24,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:58:24,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:58:24,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:58:24,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:58:24,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:58:24,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:58:24,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:58:24,374 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:58:24,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:58:24,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:58:24,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:58:24,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:58:24,378 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:58:24,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:58:24,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:58:24,378 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:58:24,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:58:24,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:58:24,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:58:24,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:58:24,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:58:24,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:58:24,383 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:58:24,383 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:58:24,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:58:24,383 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:58:24,383 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:58:24,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:58:24,383 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:58:24,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:58:24,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:58:24,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:58:24,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:58:24,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:58:24,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:58:24,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:58:24,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:58:24,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:58:24,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:58:24,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:58:24,385 INFO L153 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 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 -> 6499b62d1470f924cb4a1d4c6eb228c557a21b7be97bcd4aa73e963f3e1c7410 [2024-10-13 05:58:24,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:58:24,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:58:24,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:58:24,631 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:58:24,631 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:58:24,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i [2024-10-13 05:58:25,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:58:26,027 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:58:26,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i [2024-10-13 05:58:26,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82260a360/e93df9eb122a49e785df70cce92feb20/FLAG86d41465a [2024-10-13 05:58:26,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82260a360/e93df9eb122a49e785df70cce92feb20 [2024-10-13 05:58:26,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:58:26,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:58:26,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:58:26,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:58:26,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:58:26,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:58:26" (1/1) ... [2024-10-13 05:58:26,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2021208b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:26, skipping insertion in model container [2024-10-13 05:58:26,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:58:26" (1/1) ... [2024-10-13 05:58:26,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:58:26,607 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i[916,929] [2024-10-13 05:58:26,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:58:26,711 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:58:26,720 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i[916,929] [2024-10-13 05:58:26,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:58:26,787 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:58:26,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:26 WrapperNode [2024-10-13 05:58:26,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:58:26,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:58:26,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:58:26,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:58:26,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:26" (1/1) ... [2024-10-13 05:58:26,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:26" (1/1) ... [2024-10-13 05:58:26,873 INFO L138 Inliner]: procedures = 29, calls = 195, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 662 [2024-10-13 05:58:26,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:58:26,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:58:26,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:58:26,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:58:26,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:26" (1/1) ... [2024-10-13 05:58:26,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:26" (1/1) ... [2024-10-13 05:58:26,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:26" (1/1) ... [2024-10-13 05:58:26,937 INFO L175 MemorySlicer]: Split 166 memory accesses to 5 slices as follows [2, 34, 18, 19, 93]. 56 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 2, 4]. The 17 writes are split as follows [0, 6, 2, 2, 7]. [2024-10-13 05:58:26,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:26" (1/1) ... [2024-10-13 05:58:26,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:26" (1/1) ... [2024-10-13 05:58:26,984 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:26" (1/1) ... [2024-10-13 05:58:26,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:26" (1/1) ... [2024-10-13 05:58:27,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:26" (1/1) ... [2024-10-13 05:58:27,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:26" (1/1) ... [2024-10-13 05:58:27,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:58:27,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:58:27,023 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:58:27,023 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:58:27,024 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:26" (1/1) ... [2024-10-13 05:58:27,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:58:27,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:58:27,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:58:27,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:58:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:58:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 05:58:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 05:58:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-13 05:58:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-13 05:58:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-13 05:58:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 05:58:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 05:58:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 05:58:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 05:58:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 05:58:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 05:58:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 05:58:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-13 05:58:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-13 05:58:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-13 05:58:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 05:58:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 05:58:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 05:58:27,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 05:58:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 05:58:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 05:58:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 05:58:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-13 05:58:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-13 05:58:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-13 05:58:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:58:27,133 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:58:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:58:27,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 05:58:27,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 05:58:27,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 05:58:27,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 05:58:27,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:58:27,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:58:27,261 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:58:27,263 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:58:27,768 INFO L? ?]: Removed 216 outVars from TransFormulas that were not future-live. [2024-10-13 05:58:27,768 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:58:27,802 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:58:27,803 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:58:27,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:58:27 BoogieIcfgContainer [2024-10-13 05:58:27,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:58:27,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:58:27,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:58:27,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:58:27,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:58:26" (1/3) ... [2024-10-13 05:58:27,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52bf0e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:58:27, skipping insertion in model container [2024-10-13 05:58:27,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:26" (2/3) ... [2024-10-13 05:58:27,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52bf0e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:58:27, skipping insertion in model container [2024-10-13 05:58:27,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:58:27" (3/3) ... [2024-10-13 05:58:27,810 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-49.i [2024-10-13 05:58:27,822 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:58:27,822 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:58:27,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:58:27,875 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@4d60fd20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:58:27,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:58:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 112 states have (on average 1.5) internal successors, (168), 113 states have internal predecessors, (168), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:58:27,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 05:58:27,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:27,892 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:27,892 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:27,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:27,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2112765976, now seen corresponding path program 1 times [2024-10-13 05:58:27,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:58:27,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511715202] [2024-10-13 05:58:27,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:27,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:58:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:58:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:58:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:58:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:58:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:58:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:58:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:58:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:58:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:58:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:58:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:58:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:58:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:58:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:58:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:58:28,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:58:28,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511715202] [2024-10-13 05:58:28,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511715202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:28,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:28,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:58:28,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440128047] [2024-10-13 05:58:28,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:28,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:58:28,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:58:28,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:58:28,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:58:28,201 INFO L87 Difference]: Start difference. First operand has 129 states, 112 states have (on average 1.5) internal successors, (168), 113 states have internal predecessors, (168), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:28,240 INFO L93 Difference]: Finished difference Result 255 states and 404 transitions. [2024-10-13 05:58:28,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:58:28,262 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2024-10-13 05:58:28,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:28,276 INFO L225 Difference]: With dead ends: 255 [2024-10-13 05:58:28,276 INFO L226 Difference]: Without dead ends: 127 [2024-10-13 05:58:28,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:58:28,286 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:28,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:58:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-13 05:58:28,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-10-13 05:58:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 111 states have (on average 1.4684684684684686) internal successors, (163), 111 states have internal predecessors, (163), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:58:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 191 transitions. [2024-10-13 05:58:28,371 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 191 transitions. Word has length 112 [2024-10-13 05:58:28,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:28,372 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 191 transitions. [2024-10-13 05:58:28,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 191 transitions. [2024-10-13 05:58:28,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 05:58:28,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:28,378 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:28,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:58:28,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:28,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash 209158032, now seen corresponding path program 1 times [2024-10-13 05:58:28,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:58:28,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653680333] [2024-10-13 05:58:28,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:28,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:58:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:58:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:58:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:58:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:58:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:58:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:58:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:58:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:58:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:58:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:58:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:58:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:28,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:58:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:29,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:58:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:29,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:58:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:58:29,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:58:29,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653680333] [2024-10-13 05:58:29,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653680333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:29,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:29,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:58:29,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560077368] [2024-10-13 05:58:29,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:29,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:58:29,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:58:29,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:58:29,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:58:29,013 INFO L87 Difference]: Start difference. First operand 127 states and 191 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:29,296 INFO L93 Difference]: Finished difference Result 381 states and 574 transitions. [2024-10-13 05:58:29,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:58:29,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2024-10-13 05:58:29,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:29,300 INFO L225 Difference]: With dead ends: 381 [2024-10-13 05:58:29,300 INFO L226 Difference]: Without dead ends: 255 [2024-10-13 05:58:29,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:58:29,304 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 184 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:29,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 839 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:58:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-13 05:58:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 131. [2024-10-13 05:58:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 115 states have (on average 1.4608695652173913) internal successors, (168), 115 states have internal predecessors, (168), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:58:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 196 transitions. [2024-10-13 05:58:29,322 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 196 transitions. Word has length 112 [2024-10-13 05:58:29,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:29,324 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 196 transitions. [2024-10-13 05:58:29,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 196 transitions. [2024-10-13 05:58:29,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 05:58:29,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:29,328 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:29,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:58:29,330 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:29,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:29,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1025675883, now seen corresponding path program 1 times [2024-10-13 05:58:29,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:58:29,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329687717] [2024-10-13 05:58:29,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:29,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:58:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:29,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:58:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:29,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:58:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:30,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:58:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:30,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:58:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:30,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:58:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:30,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:58:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:30,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:58:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:30,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:58:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:30,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:58:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:30,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:58:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:30,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:58:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:30,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:58:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:30,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:58:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:30,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:58:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:58:30,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:58:30,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329687717] [2024-10-13 05:58:30,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329687717] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:58:30,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121769209] [2024-10-13 05:58:30,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:30,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:58:30,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:58:30,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:58:30,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 05:58:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:30,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 05:58:30,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:30,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 55 [2024-10-13 05:58:30,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-13 05:58:30,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-10-13 05:58:30,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:30,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 42 [2024-10-13 05:58:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:58:30,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:30,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121769209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:30,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:58:30,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2024-10-13 05:58:30,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989093497] [2024-10-13 05:58:30,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:30,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:58:30,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:58:30,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:58:30,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-13 05:58:30,706 INFO L87 Difference]: Start difference. First operand 131 states and 196 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:30,944 INFO L93 Difference]: Finished difference Result 377 states and 564 transitions. [2024-10-13 05:58:30,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:58:30,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-13 05:58:30,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:30,947 INFO L225 Difference]: With dead ends: 377 [2024-10-13 05:58:30,947 INFO L226 Difference]: Without dead ends: 247 [2024-10-13 05:58:30,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-10-13 05:58:30,951 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 154 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:30,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1391 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:58:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-13 05:58:30,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244. [2024-10-13 05:58:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 222 states have internal predecessors, (326), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:58:30,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 366 transitions. [2024-10-13 05:58:30,975 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 366 transitions. Word has length 114 [2024-10-13 05:58:30,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:30,976 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 366 transitions. [2024-10-13 05:58:30,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 366 transitions. [2024-10-13 05:58:30,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 05:58:30,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:30,977 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:30,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 05:58:31,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:58:31,185 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:31,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash -345617513, now seen corresponding path program 1 times [2024-10-13 05:58:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:58:31,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379868454] [2024-10-13 05:58:31,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:31,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:58:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:31,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:58:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:31,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:58:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:31,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:58:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:31,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:58:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:31,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:58:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:31,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:58:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:31,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:58:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:31,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:58:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:31,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:58:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:31,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:58:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:31,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:58:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:31,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:58:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:31,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:58:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:31,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:58:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:58:31,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:58:31,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379868454] [2024-10-13 05:58:31,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379868454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:31,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:31,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:58:31,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935798553] [2024-10-13 05:58:31,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:31,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:58:31,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:58:31,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:58:31,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:58:31,459 INFO L87 Difference]: Start difference. First operand 244 states and 366 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:31,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:31,541 INFO L93 Difference]: Finished difference Result 515 states and 769 transitions. [2024-10-13 05:58:31,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:58:31,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-13 05:58:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:31,544 INFO L225 Difference]: With dead ends: 515 [2024-10-13 05:58:31,544 INFO L226 Difference]: Without dead ends: 272 [2024-10-13 05:58:31,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:58:31,547 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 151 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:31,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 681 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:58:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-13 05:58:31,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 243. [2024-10-13 05:58:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 220 states have (on average 1.4727272727272727) internal successors, (324), 221 states have internal predecessors, (324), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:58:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 364 transitions. [2024-10-13 05:58:31,571 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 364 transitions. Word has length 114 [2024-10-13 05:58:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:31,573 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 364 transitions. [2024-10-13 05:58:31,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:31,573 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 364 transitions. [2024-10-13 05:58:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 05:58:31,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:31,574 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:31,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:58:31,575 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:31,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:31,576 INFO L85 PathProgramCache]: Analyzing trace with hash -243904292, now seen corresponding path program 1 times [2024-10-13 05:58:31,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:58:31,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330154857] [2024-10-13 05:58:31,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:31,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:58:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:32,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:58:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:32,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:58:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:32,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:58:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:32,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:58:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:32,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:58:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:32,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:58:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:32,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:58:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:32,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:58:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:32,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:58:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:32,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:58:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:32,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:58:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:32,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:58:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:32,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:58:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:32,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:58:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:58:32,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:58:32,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330154857] [2024-10-13 05:58:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330154857] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:58:32,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583001156] [2024-10-13 05:58:32,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:32,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:58:32,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:58:32,219 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:58:32,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 05:58:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:32,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 05:58:32,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:32,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-13 05:58:32,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2024-10-13 05:58:32,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:32,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 80 [2024-10-13 05:58:32,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:32,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2024-10-13 05:58:32,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:32,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 34 [2024-10-13 05:58:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-13 05:58:32,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:58:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:58:32,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583001156] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:58:32,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 05:58:32,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2024-10-13 05:58:32,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396913141] [2024-10-13 05:58:32,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 05:58:32,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 05:58:32,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:58:32,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 05:58:32,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:58:32,925 INFO L87 Difference]: Start difference. First operand 243 states and 364 transitions. Second operand has 15 states, 12 states have (on average 7.333333333333333) internal successors, (88), 15 states have internal predecessors, (88), 7 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 4 states have call predecessors, (41), 7 states have call successors, (41) [2024-10-13 05:58:33,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:33,653 INFO L93 Difference]: Finished difference Result 661 states and 985 transitions. [2024-10-13 05:58:33,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 05:58:33,653 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 7.333333333333333) internal successors, (88), 15 states have internal predecessors, (88), 7 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 4 states have call predecessors, (41), 7 states have call successors, (41) Word has length 114 [2024-10-13 05:58:33,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:33,657 INFO L225 Difference]: With dead ends: 661 [2024-10-13 05:58:33,657 INFO L226 Difference]: Without dead ends: 419 [2024-10-13 05:58:33,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 246 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2024-10-13 05:58:33,660 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 379 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:33,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 559 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:58:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-13 05:58:33,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 251. [2024-10-13 05:58:33,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 227 states have internal predecessors, (328), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:58:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 368 transitions. [2024-10-13 05:58:33,678 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 368 transitions. Word has length 114 [2024-10-13 05:58:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:33,679 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 368 transitions. [2024-10-13 05:58:33,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 7.333333333333333) internal successors, (88), 15 states have internal predecessors, (88), 7 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 4 states have call predecessors, (41), 7 states have call successors, (41) [2024-10-13 05:58:33,680 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 368 transitions. [2024-10-13 05:58:33,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 05:58:33,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:33,682 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:33,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 05:58:33,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:58:33,882 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:33,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:33,883 INFO L85 PathProgramCache]: Analyzing trace with hash -2011011870, now seen corresponding path program 1 times [2024-10-13 05:58:33,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:58:33,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51004400] [2024-10-13 05:58:33,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:33,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:58:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:34,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:58:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:34,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:58:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:34,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 05:58:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:34,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 05:58:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:34,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:58:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:34,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 05:58:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:34,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 05:58:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:34,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 05:58:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:34,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 05:58:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:34,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:58:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:34,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 05:58:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:34,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:58:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:34,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:58:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:34,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:58:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:34,355 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:58:34,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:58:34,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51004400] [2024-10-13 05:58:34,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51004400] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:58:34,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903027107] [2024-10-13 05:58:34,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:34,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:58:34,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:58:34,357 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:58:34,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 05:58:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:34,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 05:58:34,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:34,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 52 [2024-10-13 05:58:34,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 70 [2024-10-13 05:58:34,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2024-10-13 05:58:34,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:34,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2024-10-13 05:58:34,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:34,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 15 [2024-10-13 05:58:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-13 05:58:34,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:58:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:58:35,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903027107] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:58:35,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 05:58:35,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 15 [2024-10-13 05:58:35,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671490325] [2024-10-13 05:58:35,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 05:58:35,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 05:58:35,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:58:35,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 05:58:35,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:58:35,019 INFO L87 Difference]: Start difference. First operand 251 states and 368 transitions. Second operand has 15 states, 12 states have (on average 6.0) internal successors, (72), 15 states have internal predecessors, (72), 6 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 6 states have call successors, (29) [2024-10-13 05:58:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:36,228 INFO L93 Difference]: Finished difference Result 1147 states and 1662 transitions. [2024-10-13 05:58:36,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-13 05:58:36,229 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 6.0) internal successors, (72), 15 states have internal predecessors, (72), 6 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 6 states have call successors, (29) Word has length 116 [2024-10-13 05:58:36,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:36,232 INFO L225 Difference]: With dead ends: 1147 [2024-10-13 05:58:36,233 INFO L226 Difference]: Without dead ends: 897 [2024-10-13 05:58:36,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 253 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=434, Invalid=1458, Unknown=0, NotChecked=0, Total=1892 [2024-10-13 05:58:36,234 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1456 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1457 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:36,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1457 Valid, 909 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 05:58:36,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-10-13 05:58:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 267. [2024-10-13 05:58:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 240 states have (on average 1.4416666666666667) internal successors, (346), 241 states have internal predecessors, (346), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:58:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 386 transitions. [2024-10-13 05:58:36,251 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 386 transitions. Word has length 116 [2024-10-13 05:58:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:36,252 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 386 transitions. [2024-10-13 05:58:36,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 6.0) internal successors, (72), 15 states have internal predecessors, (72), 6 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 6 states have call successors, (29) [2024-10-13 05:58:36,252 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 386 transitions. [2024-10-13 05:58:36,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 05:58:36,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:36,253 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:36,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 05:58:36,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:58:36,455 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:36,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:36,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1752846432, now seen corresponding path program 1 times [2024-10-13 05:58:36,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:58:36,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995792061] [2024-10-13 05:58:36,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:36,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:58:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:58:36,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:58:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:58:36,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:58:36,577 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:58:36,577 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:58:36,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 05:58:36,581 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:36,655 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:58:36,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:58:36 BoogieIcfgContainer [2024-10-13 05:58:36,657 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:58:36,657 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:58:36,657 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:58:36,658 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:58:36,658 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:58:27" (3/4) ... [2024-10-13 05:58:36,659 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:58:36,660 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:58:36,661 INFO L158 Benchmark]: Toolchain (without parser) took 10226.60ms. Allocated memory was 142.6MB in the beginning and 325.1MB in the end (delta: 182.5MB). Free memory was 72.2MB in the beginning and 259.7MB in the end (delta: -187.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:58:36,661 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:58:36,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.56ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 53.0MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 05:58:36,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.49ms. Allocated memory is still 142.6MB. Free memory was 53.0MB in the beginning and 47.5MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:58:36,661 INFO L158 Benchmark]: Boogie Preprocessor took 147.31ms. Allocated memory was 142.6MB in the beginning and 216.0MB in the end (delta: 73.4MB). Free memory was 47.3MB in the beginning and 182.4MB in the end (delta: -135.1MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-10-13 05:58:36,662 INFO L158 Benchmark]: RCFGBuilder took 780.80ms. Allocated memory is still 216.0MB. Free memory was 182.4MB in the beginning and 131.0MB in the end (delta: 51.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-10-13 05:58:36,662 INFO L158 Benchmark]: TraceAbstraction took 8851.43ms. Allocated memory was 216.0MB in the beginning and 325.1MB in the end (delta: 109.1MB). Free memory was 131.0MB in the beginning and 259.7MB in the end (delta: -128.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:58:36,662 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 325.1MB. Free memory is still 259.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:58:36,663 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.56ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 53.0MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.49ms. Allocated memory is still 142.6MB. Free memory was 53.0MB in the beginning and 47.5MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 147.31ms. Allocated memory was 142.6MB in the beginning and 216.0MB in the end (delta: 73.4MB). Free memory was 47.3MB in the beginning and 182.4MB in the end (delta: -135.1MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * RCFGBuilder took 780.80ms. Allocated memory is still 216.0MB. Free memory was 182.4MB in the beginning and 131.0MB in the end (delta: 51.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8851.43ms. Allocated memory was 216.0MB in the beginning and 325.1MB in the end (delta: 109.1MB). Free memory was 131.0MB in the beginning and 259.7MB in the end (delta: -128.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 325.1MB. Free memory is still 259.7MB. 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: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 0} }; [L25-L27] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L25-L27] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L25-L27] float float_Array_0[2] = { 1000.2, 1000000000000000.4 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L28-L30] signed short int signed_short_int_Array_0[2] = { -2, 128 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2][2] = { {10, 256}, {4, 4} }; [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] float_Array_0[0] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] float_Array_0[1] = __VERIFIER_nondet_float() [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L75] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L76] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] unsigned_short_int_Array_0[0][0] = __VERIFIER_nondet_ushort() [L79] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L82] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L85] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L99] RET updateVariables() [L100] CALL step() [L37] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] EXPR ((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]) [L37] EXPR signed_short_int_Array_0[0] [L37] EXPR ((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L37] signed_short_int_Array_0[1] = ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))) [L38] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L38] EXPR 50 >> unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L38] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L38] COND FALSE !((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) [L41] EXPR BOOL_unsigned_char_Array_0[1][1] [L41] BOOL_unsigned_char_Array_0[0][1] = (! BOOL_unsigned_char_Array_0[1][1]) [L43] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L43] COND TRUE ! BOOL_unsigned_char_Array_0[0][0] [L44] EXPR unsigned_short_int_Array_0[0][1] [L44] EXPR unsigned_short_int_Array_0[0][0] [L44] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L44] EXPR ((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1]) [L44] EXPR unsigned_short_int_Array_0[0][0] [L44] EXPR ((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L44] COND FALSE !(unsigned_short_int_Array_0[0][1] >= ((((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1])))) [L47] EXPR BOOL_unsigned_char_Array_0[1][1] [L47] BOOL_unsigned_char_Array_0[1][0] = BOOL_unsigned_char_Array_0[1][1] [L50] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L50] COND TRUE float_Array_0[1] >= 64.5f [L51] EXPR float_Array_0[1] [L51] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L51] COND FALSE !(float_Array_0[1] >= float_Array_0[0]) [L54] BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L54] COND FALSE !(BOOL_unsigned_char_Array_0[1][0]) [L57] EXPR unsigned_short_int_Array_0[0][0] [L57] unsigned_short_int_Array_0[1][1] = unsigned_short_int_Array_0[0][0] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR (float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50)) [L91] EXPR unsigned_short_int_Array_0[1][1] [L91] EXPR (float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR ((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR ((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR (((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR (((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR ((((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))))) && ((! BOOL_unsigned_char_Array_0[0][0]) ? ((unsigned_short_int_Array_0[0][1] >= ((((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR ((((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))))) && ((! BOOL_unsigned_char_Array_0[0][0]) ? ((unsigned_short_int_Array_0[0][1] >= ((((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91-L92] return ((((float_Array_0[1] >= 64.5f) ? ((float_Array_0[1] >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) (((((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) < 0 ) ? -((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))) : ((((unsigned_short_int_Array_0[0][1]) > (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0]))))) ? (unsigned_short_int_Array_0[0][1]) : (((((unsigned_short_int_Array_0[1][0]) > (unsigned_short_int_Array_0[0][0])) ? (unsigned_short_int_Array_0[1][0]) : (unsigned_short_int_Array_0[0][0])))))))))) : (BOOL_unsigned_char_Array_0[1][0] ? (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[1][0])) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) unsigned_short_int_Array_0[0][0])))) : (unsigned_short_int_Array_0[1][1] == ((unsigned short int) 50))) && (signed_short_int_Array_0[1] == ((signed short int) ((((signed_short_int_Array_0[0]) < 0 ) ? -(signed_short_int_Array_0[0]) : (signed_short_int_Array_0[0])))))) && (((50 >> unsigned_short_int_Array_0[0][1]) <= signed_short_int_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) ((! (! BOOL_unsigned_char_Array_0[1][1])) || BOOL_unsigned_char_Array_0[0][0]))) : (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][1]))))) && ((! BOOL_unsigned_char_Array_0[0][0]) ? ((unsigned_short_int_Array_0[0][1] >= ((((unsigned_short_int_Array_0[0][0]) < (signed_short_int_Array_0[1])) ? (unsigned_short_int_Array_0[0][0]) : (signed_short_int_Array_0[1])))) ? (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) : (BOOL_unsigned_char_Array_0[1][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][1]))) : 1) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 7, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2325 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2324 mSDsluCounter, 4566 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3531 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2650 IncrementalHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 1035 mSDtfsCounter, 2650 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 842 GetRequests, 743 SyntacticMatches, 9 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267occurred in iteration=6, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 954 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1142 NumberOfCodeBlocks, 1142 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1245 ConstructedInterpolants, 0 QuantifiedInterpolants, 6014 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1172 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 3770/4004 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 05:58:36,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 6499b62d1470f924cb4a1d4c6eb228c557a21b7be97bcd4aa73e963f3e1c7410 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:58:38,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:58:38,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:58:38,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:58:38,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:58:38,634 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:58:38,636 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:58:38,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:58:38,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:58:38,637 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:58:38,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:58:38,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:58:38,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:58:38,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:58:38,639 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:58:38,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:58:38,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:58:38,640 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:58:38,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:58:38,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:58:38,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:58:38,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:58:38,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:58:38,641 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:58:38,641 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:58:38,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:58:38,642 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:58:38,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:58:38,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:58:38,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:58:38,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:58:38,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:58:38,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:58:38,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:58:38,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:58:38,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:58:38,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:58:38,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:58:38,644 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:58:38,645 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:58:38,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:58:38,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:58:38,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:58:38,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:58:38,646 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:58:38,646 INFO L153 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 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 -> 6499b62d1470f924cb4a1d4c6eb228c557a21b7be97bcd4aa73e963f3e1c7410 [2024-10-13 05:58:38,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:58:38,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:58:38,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:58:38,944 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:58:38,944 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:58:38,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i [2024-10-13 05:58:40,192 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:58:40,384 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:58:40,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i [2024-10-13 05:58:40,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bbd1f651/33629d5a25844714bd62f7a2514d28c5/FLAG8812515b5 [2024-10-13 05:58:40,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bbd1f651/33629d5a25844714bd62f7a2514d28c5 [2024-10-13 05:58:40,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:58:40,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:58:40,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:58:40,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:58:40,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:58:40,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:58:40" (1/1) ... [2024-10-13 05:58:40,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c091bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:40, skipping insertion in model container [2024-10-13 05:58:40,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:58:40" (1/1) ... [2024-10-13 05:58:40,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:58:40,568 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i[916,929] [2024-10-13 05:58:40,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:58:40,656 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:58:40,666 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-49.i[916,929] [2024-10-13 05:58:40,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:58:40,754 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:58:40,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:40 WrapperNode [2024-10-13 05:58:40,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:58:40,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:58:40,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:58:40,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:58:40,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:40" (1/1) ... [2024-10-13 05:58:40,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:40" (1/1) ... [2024-10-13 05:58:40,810 INFO L138 Inliner]: procedures = 33, calls = 195, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 647 [2024-10-13 05:58:40,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:58:40,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:58:40,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:58:40,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:58:40,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:40" (1/1) ... [2024-10-13 05:58:40,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:40" (1/1) ... [2024-10-13 05:58:40,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:40" (1/1) ... [2024-10-13 05:58:40,852 INFO L175 MemorySlicer]: Split 166 memory accesses to 5 slices as follows [2, 34, 18, 19, 93]. 56 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 2, 2, 4]. The 17 writes are split as follows [0, 6, 2, 2, 7]. [2024-10-13 05:58:40,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:40" (1/1) ... [2024-10-13 05:58:40,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:40" (1/1) ... [2024-10-13 05:58:40,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:40" (1/1) ... [2024-10-13 05:58:40,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:40" (1/1) ... [2024-10-13 05:58:40,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:40" (1/1) ... [2024-10-13 05:58:40,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:40" (1/1) ... [2024-10-13 05:58:40,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:58:40,891 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:58:40,891 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:58:40,891 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:58:40,891 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:40" (1/1) ... [2024-10-13 05:58:40,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:58:40,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:58:40,918 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:58:40,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:58:40,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:58:40,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 05:58:40,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 05:58:40,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 05:58:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-13 05:58:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-13 05:58:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 05:58:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 05:58:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-13 05:58:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-13 05:58:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-13 05:58:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:58:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 05:58:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 05:58:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-13 05:58:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-13 05:58:40,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 05:58:40,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 05:58:40,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-13 05:58:40,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-13 05:58:40,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-13 05:58:40,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 05:58:40,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 05:58:40,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-13 05:58:40,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-13 05:58:40,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-13 05:58:40,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 05:58:40,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 05:58:40,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-13 05:58:40,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-13 05:58:40,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-13 05:58:40,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 05:58:40,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 05:58:40,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-13 05:58:40,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-13 05:58:40,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-13 05:58:40,955 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:58:40,955 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:58:40,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:58:40,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:58:40,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 05:58:40,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 05:58:40,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-13 05:58:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-13 05:58:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-13 05:58:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 05:58:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 05:58:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-13 05:58:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-13 05:58:40,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-13 05:58:41,072 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:58:41,074 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:58:41,604 INFO L? ?]: Removed 212 outVars from TransFormulas that were not future-live. [2024-10-13 05:58:41,604 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:58:41,642 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:58:41,643 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:58:41,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:58:41 BoogieIcfgContainer [2024-10-13 05:58:41,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:58:41,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:58:41,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:58:41,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:58:41,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:58:40" (1/3) ... [2024-10-13 05:58:41,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6acc36b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:58:41, skipping insertion in model container [2024-10-13 05:58:41,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:58:40" (2/3) ... [2024-10-13 05:58:41,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6acc36b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:58:41, skipping insertion in model container [2024-10-13 05:58:41,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:58:41" (3/3) ... [2024-10-13 05:58:41,650 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-49.i [2024-10-13 05:58:41,662 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:58:41,662 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:58:41,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:58:41,721 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@152c80eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:58:41,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:58:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 106 states have (on average 1.509433962264151) internal successors, (160), 107 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:58:41,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 05:58:41,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:41,738 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:41,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:41,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:41,742 INFO L85 PathProgramCache]: Analyzing trace with hash -568812109, now seen corresponding path program 1 times [2024-10-13 05:58:41,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:41,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888440370] [2024-10-13 05:58:41,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:41,752 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 [2024-10-13 05:58:41,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:41,753 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) [2024-10-13 05:58:41,775 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 [2024-10-13 05:58:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:42,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 05:58:42,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-13 05:58:42,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:42,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:42,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888440370] [2024-10-13 05:58:42,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888440370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:42,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:42,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:58:42,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155595062] [2024-10-13 05:58:42,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:42,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:58:42,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:42,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:58:42,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:58:42,077 INFO L87 Difference]: Start difference. First operand has 123 states, 106 states have (on average 1.509433962264151) internal successors, (160), 107 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:42,114 INFO L93 Difference]: Finished difference Result 243 states and 388 transitions. [2024-10-13 05:58:42,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:58:42,116 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2024-10-13 05:58:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:42,122 INFO L225 Difference]: With dead ends: 243 [2024-10-13 05:58:42,122 INFO L226 Difference]: Without dead ends: 121 [2024-10-13 05:58:42,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:58:42,128 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:42,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:58:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-13 05:58:42,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-13 05:58:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.4761904761904763) internal successors, (155), 105 states have internal predecessors, (155), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:58:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 183 transitions. [2024-10-13 05:58:42,171 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 183 transitions. Word has length 110 [2024-10-13 05:58:42,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:42,171 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 183 transitions. [2024-10-13 05:58:42,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:42,172 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 183 transitions. [2024-10-13 05:58:42,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 05:58:42,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:42,176 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:42,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 05:58:42,379 WARN L453 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 [2024-10-13 05:58:42,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:42,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:42,382 INFO L85 PathProgramCache]: Analyzing trace with hash 179971931, now seen corresponding path program 1 times [2024-10-13 05:58:42,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:42,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758594331] [2024-10-13 05:58:42,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:42,383 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 [2024-10-13 05:58:42,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:42,386 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) [2024-10-13 05:58:42,387 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 [2024-10-13 05:58:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:42,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 05:58:42,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:42,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-13 05:58:42,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2024-10-13 05:58:42,779 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:58:42,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:42,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:42,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758594331] [2024-10-13 05:58:42,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758594331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:42,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:42,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:58:42,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639724376] [2024-10-13 05:58:42,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:42,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:58:42,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:42,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:58:42,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:58:42,786 INFO L87 Difference]: Start difference. First operand 121 states and 183 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:43,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:43,173 INFO L93 Difference]: Finished difference Result 363 states and 550 transitions. [2024-10-13 05:58:43,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:58:43,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2024-10-13 05:58:43,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:43,176 INFO L225 Difference]: With dead ends: 363 [2024-10-13 05:58:43,176 INFO L226 Difference]: Without dead ends: 243 [2024-10-13 05:58:43,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:58:43,178 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 176 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:43,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 795 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:58:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-13 05:58:43,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 125. [2024-10-13 05:58:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 109 states have (on average 1.4678899082568808) internal successors, (160), 109 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:58:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 188 transitions. [2024-10-13 05:58:43,194 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 188 transitions. Word has length 110 [2024-10-13 05:58:43,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:43,196 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 188 transitions. [2024-10-13 05:58:43,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 188 transitions. [2024-10-13 05:58:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 05:58:43,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:43,198 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:43,207 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 [2024-10-13 05:58:43,399 WARN L453 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 [2024-10-13 05:58:43,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:43,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:43,400 INFO L85 PathProgramCache]: Analyzing trace with hash 558927264, now seen corresponding path program 1 times [2024-10-13 05:58:43,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:43,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070755610] [2024-10-13 05:58:43,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:43,400 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 [2024-10-13 05:58:43,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:43,406 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) [2024-10-13 05:58:43,407 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 [2024-10-13 05:58:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:43,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 05:58:43,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:43,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-13 05:58:43,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-10-13 05:58:44,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-10-13 05:58:44,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-13 05:58:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-13 05:58:44,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:58:44,431 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:58:44,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:44,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070755610] [2024-10-13 05:58:44,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070755610] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:58:44,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:58:44,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2024-10-13 05:58:44,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777763066] [2024-10-13 05:58:44,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:58:44,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 05:58:44,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:44,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 05:58:44,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:58:44,436 INFO L87 Difference]: Start difference. First operand 125 states and 188 transitions. Second operand has 13 states, 11 states have (on average 7.545454545454546) internal successors, (83), 13 states have internal predecessors, (83), 6 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-13 05:58:44,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:44,826 INFO L93 Difference]: Finished difference Result 257 states and 382 transitions. [2024-10-13 05:58:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 05:58:44,827 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.545454545454546) internal successors, (83), 13 states have internal predecessors, (83), 6 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) Word has length 112 [2024-10-13 05:58:44,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:44,829 INFO L225 Difference]: With dead ends: 257 [2024-10-13 05:58:44,830 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 05:58:44,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2024-10-13 05:58:44,833 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 371 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:44,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 660 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:58:44,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 05:58:44,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2024-10-13 05:58:44,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 112 states have internal predecessors, (162), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 05:58:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 190 transitions. [2024-10-13 05:58:44,849 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 190 transitions. Word has length 112 [2024-10-13 05:58:44,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:44,850 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 190 transitions. [2024-10-13 05:58:44,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.545454545454546) internal successors, (83), 13 states have internal predecessors, (83), 6 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-13 05:58:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 190 transitions. [2024-10-13 05:58:44,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 05:58:44,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:44,852 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:44,861 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 [2024-10-13 05:58:45,052 WARN L453 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 [2024-10-13 05:58:45,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:45,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:45,054 INFO L85 PathProgramCache]: Analyzing trace with hash -839906842, now seen corresponding path program 1 times [2024-10-13 05:58:45,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:45,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313422482] [2024-10-13 05:58:45,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:45,055 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 [2024-10-13 05:58:45,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:45,057 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) [2024-10-13 05:58:45,058 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 [2024-10-13 05:58:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:45,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 05:58:45,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:45,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 05:58:45,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-10-13 05:58:45,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:45,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 34 [2024-10-13 05:58:45,763 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:58:45,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:45,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:45,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313422482] [2024-10-13 05:58:45,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313422482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:45,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:45,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 05:58:45,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80046123] [2024-10-13 05:58:45,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:45,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 05:58:45,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:45,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 05:58:45,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:58:45,765 INFO L87 Difference]: Start difference. First operand 129 states and 190 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:46,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:46,437 INFO L93 Difference]: Finished difference Result 473 states and 696 transitions. [2024-10-13 05:58:46,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 05:58:46,439 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-13 05:58:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:46,441 INFO L225 Difference]: With dead ends: 473 [2024-10-13 05:58:46,442 INFO L226 Difference]: Without dead ends: 345 [2024-10-13 05:58:46,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:58:46,443 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 287 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1986 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:46,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1986 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:58:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-13 05:58:46,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 290. [2024-10-13 05:58:46,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 265 states have (on average 1.4867924528301886) internal successors, (394), 266 states have internal predecessors, (394), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:58:46,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 434 transitions. [2024-10-13 05:58:46,469 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 434 transitions. Word has length 114 [2024-10-13 05:58:46,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:46,469 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 434 transitions. [2024-10-13 05:58:46,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 434 transitions. [2024-10-13 05:58:46,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 05:58:46,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:46,471 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:46,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 05:58:46,675 WARN L453 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 [2024-10-13 05:58:46,676 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:46,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:46,676 INFO L85 PathProgramCache]: Analyzing trace with hash -159848472, now seen corresponding path program 1 times [2024-10-13 05:58:46,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:46,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881433181] [2024-10-13 05:58:46,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:46,677 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 [2024-10-13 05:58:46,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:46,679 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) [2024-10-13 05:58:46,680 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 [2024-10-13 05:58:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:46,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 05:58:46,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:46,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 05:58:46,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-10-13 05:58:47,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:47,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 15 [2024-10-13 05:58:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:58:47,016 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:47,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:47,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881433181] [2024-10-13 05:58:47,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881433181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:47,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:47,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:58:47,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216492078] [2024-10-13 05:58:47,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:47,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:58:47,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:47,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:58:47,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:58:47,017 INFO L87 Difference]: Start difference. First operand 290 states and 434 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:47,164 INFO L93 Difference]: Finished difference Result 688 states and 1027 transitions. [2024-10-13 05:58:47,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:58:47,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-13 05:58:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:47,169 INFO L225 Difference]: With dead ends: 688 [2024-10-13 05:58:47,169 INFO L226 Difference]: Without dead ends: 399 [2024-10-13 05:58:47,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:58:47,170 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 142 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:47,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 814 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:58:47,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-13 05:58:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 295. [2024-10-13 05:58:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 270 states have (on average 1.4777777777777779) internal successors, (399), 271 states have internal predecessors, (399), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:58:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 439 transitions. [2024-10-13 05:58:47,193 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 439 transitions. Word has length 114 [2024-10-13 05:58:47,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:47,196 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 439 transitions. [2024-10-13 05:58:47,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 439 transitions. [2024-10-13 05:58:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 05:58:47,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:47,198 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:47,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 05:58:47,398 WARN L453 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 [2024-10-13 05:58:47,400 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:47,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:47,400 INFO L85 PathProgramCache]: Analyzing trace with hash -58135251, now seen corresponding path program 1 times [2024-10-13 05:58:47,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:47,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547065963] [2024-10-13 05:58:47,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:47,401 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 [2024-10-13 05:58:47,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:47,403 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) [2024-10-13 05:58:47,404 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 [2024-10-13 05:58:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:47,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 05:58:47,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:48,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-10-13 05:58:48,032 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-13 05:58:48,032 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:48,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:48,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547065963] [2024-10-13 05:58:48,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547065963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:48,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:48,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:58:48,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76884417] [2024-10-13 05:58:48,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:48,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:58:48,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:48,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:58:48,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:58:48,034 INFO L87 Difference]: Start difference. First operand 295 states and 439 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:48,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:48,496 INFO L93 Difference]: Finished difference Result 817 states and 1206 transitions. [2024-10-13 05:58:48,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:58:48,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-10-13 05:58:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:48,500 INFO L225 Difference]: With dead ends: 817 [2024-10-13 05:58:48,500 INFO L226 Difference]: Without dead ends: 523 [2024-10-13 05:58:48,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:58:48,502 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 343 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:48,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 748 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:58:48,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-10-13 05:58:48,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2024-10-13 05:58:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 470 states have (on average 1.451063829787234) internal successors, (682), 474 states have internal predecessors, (682), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 05:58:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 762 transitions. [2024-10-13 05:58:48,528 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 762 transitions. Word has length 114 [2024-10-13 05:58:48,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:48,528 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 762 transitions. [2024-10-13 05:58:48,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:48,528 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 762 transitions. [2024-10-13 05:58:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 05:58:48,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:48,529 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:48,536 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 (7)] Ended with exit code 0 [2024-10-13 05:58:48,730 WARN L453 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 [2024-10-13 05:58:48,730 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:48,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:48,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1866712552, now seen corresponding path program 1 times [2024-10-13 05:58:48,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:48,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448761223] [2024-10-13 05:58:48,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:48,731 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 [2024-10-13 05:58:48,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:48,734 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) [2024-10-13 05:58:48,734 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 [2024-10-13 05:58:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:48,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 05:58:48,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:48,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 05:58:48,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-10-13 05:58:49,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:49,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 35 [2024-10-13 05:58:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:58:49,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:49,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:49,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448761223] [2024-10-13 05:58:49,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448761223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:49,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:49,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 05:58:49,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697139649] [2024-10-13 05:58:49,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:49,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 05:58:49,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:49,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 05:58:49,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:58:49,354 INFO L87 Difference]: Start difference. First operand 519 states and 762 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:50,214 INFO L93 Difference]: Finished difference Result 1399 states and 2045 transitions. [2024-10-13 05:58:50,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 05:58:50,215 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-13 05:58:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:50,219 INFO L225 Difference]: With dead ends: 1399 [2024-10-13 05:58:50,220 INFO L226 Difference]: Without dead ends: 881 [2024-10-13 05:58:50,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:58:50,221 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 279 mSDsluCounter, 2706 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 3056 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:50,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 3056 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 05:58:50,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-10-13 05:58:50,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 521. [2024-10-13 05:58:50,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 472 states have (on average 1.4533898305084745) internal successors, (686), 476 states have internal predecessors, (686), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 05:58:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 766 transitions. [2024-10-13 05:58:50,246 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 766 transitions. Word has length 114 [2024-10-13 05:58:50,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:50,246 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 766 transitions. [2024-10-13 05:58:50,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 766 transitions. [2024-10-13 05:58:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 05:58:50,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:50,248 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:50,255 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 [2024-10-13 05:58:50,451 WARN L453 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 [2024-10-13 05:58:50,452 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:50,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:50,453 INFO L85 PathProgramCache]: Analyzing trace with hash -621052124, now seen corresponding path program 1 times [2024-10-13 05:58:50,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:50,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699819061] [2024-10-13 05:58:50,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:50,453 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 [2024-10-13 05:58:50,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:50,456 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) [2024-10-13 05:58:50,457 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 [2024-10-13 05:58:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:50,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 05:58:50,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:50,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-13 05:58:50,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2024-10-13 05:58:50,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:50,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 20 [2024-10-13 05:58:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-13 05:58:50,891 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:50,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:50,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699819061] [2024-10-13 05:58:50,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699819061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:50,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:50,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:58:50,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711082379] [2024-10-13 05:58:50,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:50,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:58:50,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:50,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:58:50,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:58:50,892 INFO L87 Difference]: Start difference. First operand 521 states and 766 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:51,110 INFO L93 Difference]: Finished difference Result 1053 states and 1540 transitions. [2024-10-13 05:58:51,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:58:51,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-10-13 05:58:51,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:51,112 INFO L225 Difference]: With dead ends: 1053 [2024-10-13 05:58:51,112 INFO L226 Difference]: Without dead ends: 533 [2024-10-13 05:58:51,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:58:51,113 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 422 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:51,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 966 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:58:51,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-10-13 05:58:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 435. [2024-10-13 05:58:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 400 states have (on average 1.46) internal successors, (584), 401 states have internal predecessors, (584), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 05:58:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 640 transitions. [2024-10-13 05:58:51,133 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 640 transitions. Word has length 114 [2024-10-13 05:58:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:51,134 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 640 transitions. [2024-10-13 05:58:51,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 640 transitions. [2024-10-13 05:58:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 05:58:51,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:51,135 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:51,143 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 (9)] Ended with exit code 0 [2024-10-13 05:58:51,336 WARN L453 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 [2024-10-13 05:58:51,336 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:51,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:51,336 INFO L85 PathProgramCache]: Analyzing trace with hash 59006246, now seen corresponding path program 1 times [2024-10-13 05:58:51,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:51,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315054633] [2024-10-13 05:58:51,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:51,337 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 [2024-10-13 05:58:51,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:51,339 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) [2024-10-13 05:58:51,340 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 [2024-10-13 05:58:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:51,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 05:58:51,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:51,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-13 05:58:51,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2024-10-13 05:58:51,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:51,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 31 [2024-10-13 05:58:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-13 05:58:51,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:51,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:51,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315054633] [2024-10-13 05:58:51,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315054633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:51,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:51,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 05:58:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109774304] [2024-10-13 05:58:51,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:51,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 05:58:51,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:51,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 05:58:51,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:58:51,966 INFO L87 Difference]: Start difference. First operand 435 states and 640 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:52,623 INFO L93 Difference]: Finished difference Result 1061 states and 1556 transitions. [2024-10-13 05:58:52,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 05:58:52,624 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-10-13 05:58:52,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:52,626 INFO L225 Difference]: With dead ends: 1061 [2024-10-13 05:58:52,626 INFO L226 Difference]: Without dead ends: 627 [2024-10-13 05:58:52,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-13 05:58:52,627 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 292 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 2219 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:52,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 2219 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:58:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-10-13 05:58:52,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 525. [2024-10-13 05:58:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 490 states have (on average 1.473469387755102) internal successors, (722), 491 states have internal predecessors, (722), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 05:58:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 778 transitions. [2024-10-13 05:58:52,651 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 778 transitions. Word has length 114 [2024-10-13 05:58:52,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:52,652 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 778 transitions. [2024-10-13 05:58:52,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:52,654 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 778 transitions. [2024-10-13 05:58:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 05:58:52,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:52,655 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:52,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 05:58:52,856 WARN L453 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 [2024-10-13 05:58:52,856 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:52,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:52,856 INFO L85 PathProgramCache]: Analyzing trace with hash 182104495, now seen corresponding path program 1 times [2024-10-13 05:58:52,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:52,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800092099] [2024-10-13 05:58:52,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:52,857 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 [2024-10-13 05:58:52,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:52,859 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) [2024-10-13 05:58:52,860 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 [2024-10-13 05:58:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:53,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 05:58:53,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-13 05:58:53,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:53,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:53,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800092099] [2024-10-13 05:58:53,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800092099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:53,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:53,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:58:53,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016861749] [2024-10-13 05:58:53,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:53,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:58:53,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:53,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:58:53,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:58:53,053 INFO L87 Difference]: Start difference. First operand 525 states and 778 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:53,102 INFO L93 Difference]: Finished difference Result 1049 states and 1555 transitions. [2024-10-13 05:58:53,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:58:53,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-10-13 05:58:53,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:53,104 INFO L225 Difference]: With dead ends: 1049 [2024-10-13 05:58:53,105 INFO L226 Difference]: Without dead ends: 525 [2024-10-13 05:58:53,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:58:53,106 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:53,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 524 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:58:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-10-13 05:58:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2024-10-13 05:58:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 490 states have (on average 1.4714285714285715) internal successors, (721), 491 states have internal predecessors, (721), 28 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 05:58:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 777 transitions. [2024-10-13 05:58:53,145 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 777 transitions. Word has length 114 [2024-10-13 05:58:53,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:53,145 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 777 transitions. [2024-10-13 05:58:53,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 777 transitions. [2024-10-13 05:58:53,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 05:58:53,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:53,147 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:53,155 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 (11)] Ended with exit code 0 [2024-10-13 05:58:53,350 WARN L453 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 [2024-10-13 05:58:53,351 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:53,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:53,351 INFO L85 PathProgramCache]: Analyzing trace with hash 558129139, now seen corresponding path program 1 times [2024-10-13 05:58:53,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:53,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662434340] [2024-10-13 05:58:53,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:53,352 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 [2024-10-13 05:58:53,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:53,353 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) [2024-10-13 05:58:53,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 05:58:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:53,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 05:58:53,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:53,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 21 [2024-10-13 05:58:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:58:53,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:53,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:53,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662434340] [2024-10-13 05:58:53,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662434340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:53,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:53,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:58:53,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687404338] [2024-10-13 05:58:53,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:53,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:58:53,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:53,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:58:53,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:58:53,686 INFO L87 Difference]: Start difference. First operand 525 states and 777 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:53,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:53,969 INFO L93 Difference]: Finished difference Result 1189 states and 1759 transitions. [2024-10-13 05:58:53,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:58:53,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-10-13 05:58:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:53,972 INFO L225 Difference]: With dead ends: 1189 [2024-10-13 05:58:53,972 INFO L226 Difference]: Without dead ends: 665 [2024-10-13 05:58:53,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:58:53,973 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 242 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:53,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 740 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:58:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-10-13 05:58:54,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 662. [2024-10-13 05:58:54,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 620 states have (on average 1.4693548387096773) internal successors, (911), 622 states have internal predecessors, (911), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 05:58:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 977 transitions. [2024-10-13 05:58:54,008 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 977 transitions. Word has length 116 [2024-10-13 05:58:54,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:54,008 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 977 transitions. [2024-10-13 05:58:54,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:54,009 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 977 transitions. [2024-10-13 05:58:54,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 05:58:54,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:54,011 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:54,018 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 [2024-10-13 05:58:54,212 WARN L453 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 [2024-10-13 05:58:54,212 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:54,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:54,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1428106450, now seen corresponding path program 1 times [2024-10-13 05:58:54,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:54,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777135265] [2024-10-13 05:58:54,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:54,214 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 [2024-10-13 05:58:54,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:54,219 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) [2024-10-13 05:58:54,220 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 [2024-10-13 05:58:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:54,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 05:58:54,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:54,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-10-13 05:58:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-13 05:58:54,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:54,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:54,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777135265] [2024-10-13 05:58:54,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777135265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:54,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:54,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:58:54,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766809240] [2024-10-13 05:58:54,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:54,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:58:54,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:54,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:58:54,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:58:54,789 INFO L87 Difference]: Start difference. First operand 662 states and 977 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:55,168 INFO L93 Difference]: Finished difference Result 1238 states and 1815 transitions. [2024-10-13 05:58:55,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:58:55,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-10-13 05:58:55,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:55,170 INFO L225 Difference]: With dead ends: 1238 [2024-10-13 05:58:55,170 INFO L226 Difference]: Without dead ends: 577 [2024-10-13 05:58:55,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:58:55,171 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 270 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:55,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 747 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:58:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-10-13 05:58:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 574. [2024-10-13 05:58:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 532 states have (on average 1.4417293233082706) internal successors, (767), 534 states have internal predecessors, (767), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 05:58:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 833 transitions. [2024-10-13 05:58:55,196 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 833 transitions. Word has length 116 [2024-10-13 05:58:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:55,196 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 833 transitions. [2024-10-13 05:58:55,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:58:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 833 transitions. [2024-10-13 05:58:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 05:58:55,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:55,199 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:55,206 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 (13)] Ended with exit code 0 [2024-10-13 05:58:55,399 WARN L453 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 [2024-10-13 05:58:55,400 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:55,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:55,400 INFO L85 PathProgramCache]: Analyzing trace with hash 344747316, now seen corresponding path program 1 times [2024-10-13 05:58:55,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:55,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584742234] [2024-10-13 05:58:55,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:55,400 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 [2024-10-13 05:58:55,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:55,401 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) [2024-10-13 05:58:55,402 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 [2024-10-13 05:58:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:55,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 05:58:55,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:55,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 05:58:55,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 47 [2024-10-13 05:58:55,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:55,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2024-10-13 05:58:55,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:55,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 97 [2024-10-13 05:58:55,937 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-13 05:58:55,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:58:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:58:56,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:56,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584742234] [2024-10-13 05:58:56,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584742234] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:58:56,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:58:56,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2024-10-13 05:58:56,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872364554] [2024-10-13 05:58:56,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:56,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:58:56,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:56,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:58:56,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:58:56,243 INFO L87 Difference]: Start difference. First operand 574 states and 833 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:56,430 INFO L93 Difference]: Finished difference Result 1325 states and 1917 transitions. [2024-10-13 05:58:56,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:58:56,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-10-13 05:58:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:56,433 INFO L225 Difference]: With dead ends: 1325 [2024-10-13 05:58:56,433 INFO L226 Difference]: Without dead ends: 752 [2024-10-13 05:58:56,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-13 05:58:56,434 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 107 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:56,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 824 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:58:56,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-10-13 05:58:56,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 678. [2024-10-13 05:58:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 636 states have (on average 1.4449685534591195) internal successors, (919), 638 states have internal predecessors, (919), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 05:58:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 985 transitions. [2024-10-13 05:58:56,460 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 985 transitions. Word has length 116 [2024-10-13 05:58:56,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:56,461 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 985 transitions. [2024-10-13 05:58:56,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:56,461 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 985 transitions. [2024-10-13 05:58:56,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 05:58:56,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:56,462 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:56,471 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 [2024-10-13 05:58:56,663 WARN L453 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 [2024-10-13 05:58:56,663 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:56,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:56,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1247675411, now seen corresponding path program 1 times [2024-10-13 05:58:56,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:56,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235860821] [2024-10-13 05:58:56,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:56,664 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 [2024-10-13 05:58:56,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:56,665 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) [2024-10-13 05:58:56,666 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 [2024-10-13 05:58:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:56,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 05:58:56,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:56,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-13 05:58:57,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2024-10-13 05:58:57,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-10-13 05:58:57,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:57,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 41 [2024-10-13 05:58:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 199 proven. 21 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 05:58:57,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:58:58,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-10-13 05:58:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:58:58,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:58,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235860821] [2024-10-13 05:58:58,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235860821] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:58:58,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:58:58,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [18] total 26 [2024-10-13 05:58:58,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693155933] [2024-10-13 05:58:58,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:58,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 05:58:58,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:58,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 05:58:58,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2024-10-13 05:58:58,118 INFO L87 Difference]: Start difference. First operand 678 states and 985 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:59,146 INFO L93 Difference]: Finished difference Result 1656 states and 2368 transitions. [2024-10-13 05:58:59,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 05:58:59,146 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-10-13 05:58:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:59,149 INFO L225 Difference]: With dead ends: 1656 [2024-10-13 05:58:59,149 INFO L226 Difference]: Without dead ends: 979 [2024-10-13 05:58:59,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2024-10-13 05:58:59,151 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 529 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:59,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 2140 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 05:58:59,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-10-13 05:58:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 588. [2024-10-13 05:58:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 546 states have (on average 1.435897435897436) internal successors, (784), 548 states have internal predecessors, (784), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 05:58:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 850 transitions. [2024-10-13 05:58:59,178 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 850 transitions. Word has length 116 [2024-10-13 05:58:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:59,178 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 850 transitions. [2024-10-13 05:58:59,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:58:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 850 transitions. [2024-10-13 05:58:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 05:58:59,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:59,179 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:58:59,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 05:58:59,380 WARN L453 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 [2024-10-13 05:58:59,380 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:59,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:59,381 INFO L85 PathProgramCache]: Analyzing trace with hash -680472501, now seen corresponding path program 1 times [2024-10-13 05:58:59,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:59,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283611025] [2024-10-13 05:58:59,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:59,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 [2024-10-13 05:58:59,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:59,382 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) [2024-10-13 05:58:59,383 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 [2024-10-13 05:58:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:59,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 05:58:59,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:59,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-10-13 05:58:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-13 05:58:59,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:58:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:58:59,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:59,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283611025] [2024-10-13 05:58:59,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283611025] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:58:59,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:58:59,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-10-13 05:58:59,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035370719] [2024-10-13 05:58:59,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:58:59,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 05:58:59,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:59,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 05:58:59,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:58:59,841 INFO L87 Difference]: Start difference. First operand 588 states and 850 transitions. Second operand has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-13 05:59:00,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:00,099 INFO L93 Difference]: Finished difference Result 1203 states and 1724 transitions. [2024-10-13 05:59:00,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 05:59:00,100 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 116 [2024-10-13 05:59:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:00,101 INFO L225 Difference]: With dead ends: 1203 [2024-10-13 05:59:00,101 INFO L226 Difference]: Without dead ends: 616 [2024-10-13 05:59:00,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-10-13 05:59:00,103 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 374 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:00,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 660 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:59:00,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-10-13 05:59:00,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 600. [2024-10-13 05:59:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 555 states have (on average 1.4216216216216215) internal successors, (789), 557 states have internal predecessors, (789), 33 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 05:59:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 855 transitions. [2024-10-13 05:59:00,131 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 855 transitions. Word has length 116 [2024-10-13 05:59:00,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:00,132 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 855 transitions. [2024-10-13 05:59:00,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-13 05:59:00,132 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 855 transitions. [2024-10-13 05:59:00,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 05:59:00,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:00,133 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:00,140 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 (16)] Ended with exit code 0 [2024-10-13 05:59:00,333 WARN L453 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 [2024-10-13 05:59:00,334 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:00,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:00,334 INFO L85 PathProgramCache]: Analyzing trace with hash -257770675, now seen corresponding path program 1 times [2024-10-13 05:59:00,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:00,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103092170] [2024-10-13 05:59:00,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:00,335 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 [2024-10-13 05:59:00,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:00,336 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) [2024-10-13 05:59:00,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 05:59:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:00,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 05:59:00,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:00,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-13 05:59:00,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2024-10-13 05:59:00,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:00,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 32 [2024-10-13 05:59:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-13 05:59:00,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:00,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:00,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103092170] [2024-10-13 05:59:00,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103092170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:00,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:00,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 05:59:00,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653087793] [2024-10-13 05:59:00,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:00,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 05:59:00,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:00,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 05:59:00,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:59:00,931 INFO L87 Difference]: Start difference. First operand 600 states and 855 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:59:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:01,677 INFO L93 Difference]: Finished difference Result 1355 states and 1913 transitions. [2024-10-13 05:59:01,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 05:59:01,678 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-10-13 05:59:01,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:01,680 INFO L225 Difference]: With dead ends: 1355 [2024-10-13 05:59:01,680 INFO L226 Difference]: Without dead ends: 756 [2024-10-13 05:59:01,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-13 05:59:01,682 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 290 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:01,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 2330 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 05:59:01,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-10-13 05:59:01,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 609. [2024-10-13 05:59:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 564 states have (on average 1.4148936170212767) internal successors, (798), 566 states have internal predecessors, (798), 33 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 05:59:01,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 864 transitions. [2024-10-13 05:59:01,734 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 864 transitions. Word has length 116 [2024-10-13 05:59:01,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:01,735 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 864 transitions. [2024-10-13 05:59:01,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:59:01,735 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 864 transitions. [2024-10-13 05:59:01,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 05:59:01,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:01,737 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:01,747 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 (17)] Ended with exit code 0 [2024-10-13 05:59:01,938 WARN L453 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 [2024-10-13 05:59:01,938 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:01,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:01,939 INFO L85 PathProgramCache]: Analyzing trace with hash 288274189, now seen corresponding path program 1 times [2024-10-13 05:59:01,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:01,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66450035] [2024-10-13 05:59:01,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:01,940 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 [2024-10-13 05:59:01,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:01,942 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) [2024-10-13 05:59:01,943 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 [2024-10-13 05:59:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:02,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 05:59:02,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:02,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 05:59:02,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-10-13 05:59:02,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:02,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 23 [2024-10-13 05:59:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:02,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:02,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:02,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66450035] [2024-10-13 05:59:02,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66450035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:02,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:02,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:59:02,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662993681] [2024-10-13 05:59:02,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:02,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:59:02,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:02,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:59:02,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:59:02,294 INFO L87 Difference]: Start difference. First operand 609 states and 864 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:02,594 INFO L93 Difference]: Finished difference Result 1393 states and 1955 transitions. [2024-10-13 05:59:02,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:59:02,595 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-10-13 05:59:02,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:02,597 INFO L225 Difference]: With dead ends: 1393 [2024-10-13 05:59:02,597 INFO L226 Difference]: Without dead ends: 785 [2024-10-13 05:59:02,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:59:02,598 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 140 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:02,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 2265 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:59:02,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-10-13 05:59:02,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 604. [2024-10-13 05:59:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 559 states have (on average 1.4168157423971377) internal successors, (792), 561 states have internal predecessors, (792), 33 states have call successors, (33), 11 states have call predecessors, (33), 11 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 05:59:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 858 transitions. [2024-10-13 05:59:02,632 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 858 transitions. Word has length 116 [2024-10-13 05:59:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:02,632 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 858 transitions. [2024-10-13 05:59:02,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 858 transitions. [2024-10-13 05:59:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 05:59:02,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:02,634 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:02,642 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 [2024-10-13 05:59:02,834 WARN L453 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 [2024-10-13 05:59:02,834 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:02,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:02,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1903514508, now seen corresponding path program 1 times [2024-10-13 05:59:02,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:02,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934118716] [2024-10-13 05:59:02,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:02,835 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 [2024-10-13 05:59:02,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:02,836 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2024-10-13 05:59:02,841 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 (19)] Waiting until timeout for monitored process [2024-10-13 05:59:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:03,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 05:59:03,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:03,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 33 [2024-10-13 05:59:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 183 proven. 24 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-13 05:59:03,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:59:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:03,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:03,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934118716] [2024-10-13 05:59:03,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934118716] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:59:03,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:59:03,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-10-13 05:59:03,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708965656] [2024-10-13 05:59:03,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:03,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:59:03,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:03,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:59:03,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-13 05:59:03,569 INFO L87 Difference]: Start difference. First operand 604 states and 858 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:03,717 INFO L93 Difference]: Finished difference Result 1126 states and 1577 transitions. [2024-10-13 05:59:03,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:59:03,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-13 05:59:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:03,719 INFO L225 Difference]: With dead ends: 1126 [2024-10-13 05:59:03,719 INFO L226 Difference]: Without dead ends: 523 [2024-10-13 05:59:03,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:59:03,720 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 108 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:03,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 532 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:59:03,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-10-13 05:59:03,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 390. [2024-10-13 05:59:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 359 states have (on average 1.4206128133704736) internal successors, (510), 359 states have internal predecessors, (510), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 05:59:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 556 transitions. [2024-10-13 05:59:03,741 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 556 transitions. Word has length 118 [2024-10-13 05:59:03,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:03,741 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 556 transitions. [2024-10-13 05:59:03,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 556 transitions. [2024-10-13 05:59:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 05:59:03,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:03,743 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:03,750 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 (19)] Ended with exit code 0 [2024-10-13 05:59:03,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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 [2024-10-13 05:59:03,943 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:03,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:03,944 INFO L85 PathProgramCache]: Analyzing trace with hash -292488145, now seen corresponding path program 1 times [2024-10-13 05:59:03,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:03,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293504859] [2024-10-13 05:59:03,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:03,944 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 [2024-10-13 05:59:03,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:03,947 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2024-10-13 05:59:03,948 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 (20)] Waiting until timeout for monitored process [2024-10-13 05:59:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:04,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 05:59:04,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:04,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:04,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:04,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293504859] [2024-10-13 05:59:04,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [293504859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:04,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:04,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:59:04,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746002222] [2024-10-13 05:59:04,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:04,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:59:04,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:04,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:59:04,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:59:04,147 INFO L87 Difference]: Start difference. First operand 390 states and 556 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:04,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:04,184 INFO L93 Difference]: Finished difference Result 395 states and 561 transitions. [2024-10-13 05:59:04,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:59:04,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-13 05:59:04,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:04,185 INFO L225 Difference]: With dead ends: 395 [2024-10-13 05:59:04,185 INFO L226 Difference]: Without dead ends: 393 [2024-10-13 05:59:04,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:59:04,186 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:04,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 691 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:59:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-13 05:59:04,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-10-13 05:59:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 362 states have (on average 1.4171270718232045) internal successors, (513), 362 states have internal predecessors, (513), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 05:59:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 559 transitions. [2024-10-13 05:59:04,206 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 559 transitions. Word has length 118 [2024-10-13 05:59:04,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:04,206 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 559 transitions. [2024-10-13 05:59:04,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 559 transitions. [2024-10-13 05:59:04,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 05:59:04,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:04,207 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:04,214 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 (20)] Ended with exit code 0 [2024-10-13 05:59:04,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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 [2024-10-13 05:59:04,408 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:04,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:04,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1808492499, now seen corresponding path program 1 times [2024-10-13 05:59:04,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:04,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808484266] [2024-10-13 05:59:04,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:04,409 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 [2024-10-13 05:59:04,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:04,410 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2024-10-13 05:59:04,411 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 (21)] Waiting until timeout for monitored process [2024-10-13 05:59:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:04,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 05:59:04,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:04,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 05:59:04,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:04,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 54 [2024-10-13 05:59:04,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:04,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 42 [2024-10-13 05:59:04,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2024-10-13 05:59:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:04,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:04,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:04,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808484266] [2024-10-13 05:59:04,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808484266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:04,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:04,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:59:04,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011083043] [2024-10-13 05:59:04,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:04,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:59:04,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:04,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:59:04,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:59:04,852 INFO L87 Difference]: Start difference. First operand 393 states and 559 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:05,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:05,799 INFO L93 Difference]: Finished difference Result 1079 states and 1508 transitions. [2024-10-13 05:59:05,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:59:05,800 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-13 05:59:05,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:05,802 INFO L225 Difference]: With dead ends: 1079 [2024-10-13 05:59:05,802 INFO L226 Difference]: Without dead ends: 687 [2024-10-13 05:59:05,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:59:05,803 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 285 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:05,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 889 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 05:59:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-10-13 05:59:05,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 679. [2024-10-13 05:59:05,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 604 states have (on average 1.3857615894039734) internal successors, (837), 608 states have internal predecessors, (837), 53 states have call successors, (53), 21 states have call predecessors, (53), 21 states have return successors, (53), 49 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-13 05:59:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 943 transitions. [2024-10-13 05:59:05,870 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 943 transitions. Word has length 118 [2024-10-13 05:59:05,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:05,870 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 943 transitions. [2024-10-13 05:59:05,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 943 transitions. [2024-10-13 05:59:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 05:59:05,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:05,874 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:05,887 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 (21)] Ended with exit code 0 [2024-10-13 05:59:06,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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 [2024-10-13 05:59:06,075 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:06,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:06,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1385790673, now seen corresponding path program 1 times [2024-10-13 05:59:06,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:06,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183756783] [2024-10-13 05:59:06,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:06,076 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 [2024-10-13 05:59:06,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:06,077 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2024-10-13 05:59:06,078 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 (22)] Waiting until timeout for monitored process [2024-10-13 05:59:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:06,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 05:59:06,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:06,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 05:59:06,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 40 [2024-10-13 05:59:06,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2024-10-13 05:59:06,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2024-10-13 05:59:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:06,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:06,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:06,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183756783] [2024-10-13 05:59:06,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183756783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:06,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:06,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:59:06,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143900192] [2024-10-13 05:59:06,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:06,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:59:06,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:06,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:59:06,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:59:06,499 INFO L87 Difference]: Start difference. First operand 679 states and 943 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:07,875 INFO L93 Difference]: Finished difference Result 1568 states and 2172 transitions. [2024-10-13 05:59:07,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:59:07,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-13 05:59:07,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:07,878 INFO L225 Difference]: With dead ends: 1568 [2024-10-13 05:59:07,879 INFO L226 Difference]: Without dead ends: 890 [2024-10-13 05:59:07,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:59:07,880 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 294 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:07,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1064 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 05:59:07,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-10-13 05:59:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 787. [2024-10-13 05:59:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 712 states have (on average 1.401685393258427) internal successors, (998), 716 states have internal predecessors, (998), 53 states have call successors, (53), 21 states have call predecessors, (53), 21 states have return successors, (53), 49 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-13 05:59:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1104 transitions. [2024-10-13 05:59:07,942 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1104 transitions. Word has length 118 [2024-10-13 05:59:07,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:07,942 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1104 transitions. [2024-10-13 05:59:07,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1104 transitions. [2024-10-13 05:59:07,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 05:59:07,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:07,943 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:07,956 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 (22)] Ended with exit code 0 [2024-10-13 05:59:08,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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 [2024-10-13 05:59:08,144 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:08,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:08,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1431855323, now seen corresponding path program 1 times [2024-10-13 05:59:08,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:08,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633170958] [2024-10-13 05:59:08,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:08,145 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 [2024-10-13 05:59:08,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:08,148 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2024-10-13 05:59:08,149 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 (23)] Waiting until timeout for monitored process [2024-10-13 05:59:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:08,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 05:59:08,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:08,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 05:59:08,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:08,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 53 [2024-10-13 05:59:08,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:08,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 41 [2024-10-13 05:59:08,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-10-13 05:59:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:08,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:08,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:08,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633170958] [2024-10-13 05:59:08,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633170958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:08,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:08,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:59:08,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467594466] [2024-10-13 05:59:08,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:08,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:59:08,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:08,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:59:08,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:59:08,619 INFO L87 Difference]: Start difference. First operand 787 states and 1104 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:09,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:09,819 INFO L93 Difference]: Finished difference Result 1780 states and 2485 transitions. [2024-10-13 05:59:09,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:59:09,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-13 05:59:09,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:09,823 INFO L225 Difference]: With dead ends: 1780 [2024-10-13 05:59:09,823 INFO L226 Difference]: Without dead ends: 994 [2024-10-13 05:59:09,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:59:09,824 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 357 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:09,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1199 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 05:59:09,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2024-10-13 05:59:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 815. [2024-10-13 05:59:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 764 states have (on average 1.4332460732984293) internal successors, (1095), 766 states have internal predecessors, (1095), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 05:59:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1163 transitions. [2024-10-13 05:59:09,866 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1163 transitions. Word has length 118 [2024-10-13 05:59:09,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:09,866 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1163 transitions. [2024-10-13 05:59:09,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:09,866 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1163 transitions. [2024-10-13 05:59:09,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 05:59:09,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:09,867 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:09,875 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 (23)] Ended with exit code 0 [2024-10-13 05:59:10,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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 [2024-10-13 05:59:10,068 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:10,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:10,069 INFO L85 PathProgramCache]: Analyzing trace with hash -257088419, now seen corresponding path program 1 times [2024-10-13 05:59:10,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:10,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674156356] [2024-10-13 05:59:10,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:10,069 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 [2024-10-13 05:59:10,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:10,072 INFO L229 MonitoredProcess]: Starting monitored process 24 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) [2024-10-13 05:59:10,073 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 (24)] Waiting until timeout for monitored process [2024-10-13 05:59:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:10,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 05:59:10,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:10,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 05:59:10,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 39 [2024-10-13 05:59:10,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 34 [2024-10-13 05:59:10,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2024-10-13 05:59:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:10,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:10,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:10,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674156356] [2024-10-13 05:59:10,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674156356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:10,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:10,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:59:10,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870831448] [2024-10-13 05:59:10,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:10,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:59:10,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:10,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:59:10,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:59:10,481 INFO L87 Difference]: Start difference. First operand 815 states and 1163 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:12,040 INFO L93 Difference]: Finished difference Result 2011 states and 2825 transitions. [2024-10-13 05:59:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:59:12,041 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-13 05:59:12,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:12,044 INFO L225 Difference]: With dead ends: 2011 [2024-10-13 05:59:12,044 INFO L226 Difference]: Without dead ends: 1197 [2024-10-13 05:59:12,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:59:12,045 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 297 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:12,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1227 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 05:59:12,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2024-10-13 05:59:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 923. [2024-10-13 05:59:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 872 states have (on average 1.4403669724770642) internal successors, (1256), 874 states have internal predecessors, (1256), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 05:59:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1324 transitions. [2024-10-13 05:59:12,092 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1324 transitions. Word has length 118 [2024-10-13 05:59:12,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:12,092 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1324 transitions. [2024-10-13 05:59:12,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1324 transitions. [2024-10-13 05:59:12,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 05:59:12,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:12,099 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:12,106 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 (24)] Forceful destruction successful, exit code 0 [2024-10-13 05:59:12,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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 [2024-10-13 05:59:12,300 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:12,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:12,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2026144512, now seen corresponding path program 1 times [2024-10-13 05:59:12,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:12,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183244736] [2024-10-13 05:59:12,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:12,301 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 [2024-10-13 05:59:12,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:12,303 INFO L229 MonitoredProcess]: Starting monitored process 25 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) [2024-10-13 05:59:12,304 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 (25)] Waiting until timeout for monitored process [2024-10-13 05:59:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:12,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 05:59:12,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:12,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 05:59:12,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-13 05:59:12,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2024-10-13 05:59:12,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:12,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2024-10-13 05:59:12,704 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-13 05:59:12,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:59:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:59:12,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183244736] [2024-10-13 05:59:12,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183244736] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:59:12,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:59:12,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-10-13 05:59:12,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965658939] [2024-10-13 05:59:12,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:59:12,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 05:59:12,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:12,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 05:59:12,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:59:12,882 INFO L87 Difference]: Start difference. First operand 923 states and 1324 transitions. Second operand has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 13 states have internal predecessors, (68), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-13 05:59:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:13,574 INFO L93 Difference]: Finished difference Result 2065 states and 2931 transitions. [2024-10-13 05:59:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-13 05:59:13,575 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 13 states have internal predecessors, (68), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 120 [2024-10-13 05:59:13,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:13,578 INFO L225 Difference]: With dead ends: 2065 [2024-10-13 05:59:13,578 INFO L226 Difference]: Without dead ends: 1143 [2024-10-13 05:59:13,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2024-10-13 05:59:13,580 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 787 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:13,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1165 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:59:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2024-10-13 05:59:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 923. [2024-10-13 05:59:13,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 872 states have (on average 1.4311926605504588) internal successors, (1248), 874 states have internal predecessors, (1248), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 05:59:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1316 transitions. [2024-10-13 05:59:13,626 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1316 transitions. Word has length 120 [2024-10-13 05:59:13,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:13,627 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1316 transitions. [2024-10-13 05:59:13,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 13 states have internal predecessors, (68), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-13 05:59:13,627 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1316 transitions. [2024-10-13 05:59:13,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 05:59:13,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:13,628 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:13,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 (25)] Forceful destruction successful, exit code 0 [2024-10-13 05:59:13,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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 [2024-10-13 05:59:13,833 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:13,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:13,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1247754430, now seen corresponding path program 1 times [2024-10-13 05:59:13,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:13,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152711145] [2024-10-13 05:59:13,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:13,834 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 [2024-10-13 05:59:13,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:13,835 INFO L229 MonitoredProcess]: Starting monitored process 26 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) [2024-10-13 05:59:13,836 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 (26)] Waiting until timeout for monitored process [2024-10-13 05:59:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:14,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 05:59:14,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:14,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:14,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:14,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152711145] [2024-10-13 05:59:14,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152711145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:14,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:14,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:59:14,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749817954] [2024-10-13 05:59:14,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:14,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:59:14,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:14,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:59:14,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:59:14,054 INFO L87 Difference]: Start difference. First operand 923 states and 1316 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:14,264 INFO L93 Difference]: Finished difference Result 2455 states and 3486 transitions. [2024-10-13 05:59:14,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:59:14,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-10-13 05:59:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:14,269 INFO L225 Difference]: With dead ends: 2455 [2024-10-13 05:59:14,269 INFO L226 Difference]: Without dead ends: 1533 [2024-10-13 05:59:14,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:59:14,270 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 137 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:14,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 887 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:59:14,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2024-10-13 05:59:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 971. [2024-10-13 05:59:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 920 states have (on average 1.4217391304347826) internal successors, (1308), 922 states have internal predecessors, (1308), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 05:59:14,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1376 transitions. [2024-10-13 05:59:14,330 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1376 transitions. Word has length 120 [2024-10-13 05:59:14,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:14,330 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1376 transitions. [2024-10-13 05:59:14,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1376 transitions. [2024-10-13 05:59:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 05:59:14,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:14,332 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:14,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-10-13 05:59:14,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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 [2024-10-13 05:59:14,533 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:14,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:14,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1505919868, now seen corresponding path program 1 times [2024-10-13 05:59:14,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:14,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273208205] [2024-10-13 05:59:14,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:14,534 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 [2024-10-13 05:59:14,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:14,536 INFO L229 MonitoredProcess]: Starting monitored process 27 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) [2024-10-13 05:59:14,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-13 05:59:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:14,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 05:59:14,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:14,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 05:59:14,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-10-13 05:59:15,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:15,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 54 [2024-10-13 05:59:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-13 05:59:15,441 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:15,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:15,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273208205] [2024-10-13 05:59:15,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273208205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:15,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:15,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:59:15,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281608878] [2024-10-13 05:59:15,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:15,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:59:15,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:15,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:59:15,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:59:15,442 INFO L87 Difference]: Start difference. First operand 971 states and 1376 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:59:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:16,022 INFO L93 Difference]: Finished difference Result 2845 states and 4040 transitions. [2024-10-13 05:59:16,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 05:59:16,023 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2024-10-13 05:59:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:16,028 INFO L225 Difference]: With dead ends: 2845 [2024-10-13 05:59:16,028 INFO L226 Difference]: Without dead ends: 1875 [2024-10-13 05:59:16,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:59:16,030 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 397 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:16,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1023 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:59:16,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2024-10-13 05:59:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1117. [2024-10-13 05:59:16,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 1045 states have (on average 1.4086124401913875) internal successors, (1472), 1048 states have internal predecessors, (1472), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:59:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1568 transitions. [2024-10-13 05:59:16,108 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1568 transitions. Word has length 120 [2024-10-13 05:59:16,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:16,108 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1568 transitions. [2024-10-13 05:59:16,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:59:16,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1568 transitions. [2024-10-13 05:59:16,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 05:59:16,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:16,111 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:16,120 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 (27)] Ended with exit code 0 [2024-10-13 05:59:16,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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 [2024-10-13 05:59:16,311 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:16,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:16,312 INFO L85 PathProgramCache]: Analyzing trace with hash -107152334, now seen corresponding path program 1 times [2024-10-13 05:59:16,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:16,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555859578] [2024-10-13 05:59:16,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:16,312 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 [2024-10-13 05:59:16,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:16,315 INFO L229 MonitoredProcess]: Starting monitored process 28 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) [2024-10-13 05:59:16,316 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 (28)] Waiting until timeout for monitored process [2024-10-13 05:59:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:16,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 05:59:16,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:16,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 05:59:16,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2024-10-13 05:59:16,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-10-13 05:59:16,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-10-13 05:59:16,752 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:16,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:16,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:16,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555859578] [2024-10-13 05:59:16,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1555859578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:16,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:16,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:59:16,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690528822] [2024-10-13 05:59:16,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:16,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:59:16,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:16,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:59:16,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:59:16,754 INFO L87 Difference]: Start difference. First operand 1117 states and 1568 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:18,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:18,003 INFO L93 Difference]: Finished difference Result 2743 states and 3795 transitions. [2024-10-13 05:59:18,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:59:18,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-10-13 05:59:18,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:18,009 INFO L225 Difference]: With dead ends: 2743 [2024-10-13 05:59:18,009 INFO L226 Difference]: Without dead ends: 1627 [2024-10-13 05:59:18,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:59:18,011 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 409 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:18,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 714 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 05:59:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2024-10-13 05:59:18,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1137. [2024-10-13 05:59:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1065 states have (on average 1.412206572769953) internal successors, (1504), 1068 states have internal predecessors, (1504), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:59:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1600 transitions. [2024-10-13 05:59:18,083 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1600 transitions. Word has length 120 [2024-10-13 05:59:18,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:18,084 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1600 transitions. [2024-10-13 05:59:18,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1600 transitions. [2024-10-13 05:59:18,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 05:59:18,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:18,086 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:18,094 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 (28)] Forceful destruction successful, exit code 0 [2024-10-13 05:59:18,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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 [2024-10-13 05:59:18,287 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:18,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:18,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1912590668, now seen corresponding path program 1 times [2024-10-13 05:59:18,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:18,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489394539] [2024-10-13 05:59:18,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:18,288 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 [2024-10-13 05:59:18,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:18,290 INFO L229 MonitoredProcess]: Starting monitored process 29 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) [2024-10-13 05:59:18,291 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 (29)] Waiting until timeout for monitored process [2024-10-13 05:59:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:18,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 05:59:18,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:18,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 05:59:18,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 05:59:18,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-10-13 05:59:18,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 39 [2024-10-13 05:59:19,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 34 [2024-10-13 05:59:19,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:19,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 42 [2024-10-13 05:59:19,076 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:19,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:19,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:19,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489394539] [2024-10-13 05:59:19,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489394539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:19,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:19,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 05:59:19,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941532186] [2024-10-13 05:59:19,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:19,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 05:59:19,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:19,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 05:59:19,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-13 05:59:19,077 INFO L87 Difference]: Start difference. First operand 1137 states and 1600 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:21,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:21,460 INFO L93 Difference]: Finished difference Result 2749 states and 3774 transitions. [2024-10-13 05:59:21,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 05:59:21,461 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-10-13 05:59:21,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:21,466 INFO L225 Difference]: With dead ends: 2749 [2024-10-13 05:59:21,466 INFO L226 Difference]: Without dead ends: 1613 [2024-10-13 05:59:21,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:59:21,467 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 515 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:21,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1829 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 05:59:21,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2024-10-13 05:59:21,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1128. [2024-10-13 05:59:21,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1056 states have (on average 1.4147727272727273) internal successors, (1494), 1059 states have internal predecessors, (1494), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:59:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1590 transitions. [2024-10-13 05:59:21,535 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1590 transitions. Word has length 120 [2024-10-13 05:59:21,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:21,535 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1590 transitions. [2024-10-13 05:59:21,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1590 transitions. [2024-10-13 05:59:21,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 05:59:21,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:21,537 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:21,546 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 (29)] Ended with exit code 0 [2024-10-13 05:59:21,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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 [2024-10-13 05:59:21,738 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:21,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:21,738 INFO L85 PathProgramCache]: Analyzing trace with hash -774750700, now seen corresponding path program 1 times [2024-10-13 05:59:21,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:21,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180148865] [2024-10-13 05:59:21,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:21,739 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 [2024-10-13 05:59:21,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:21,740 INFO L229 MonitoredProcess]: Starting monitored process 30 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) [2024-10-13 05:59:21,741 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 (30)] Waiting until timeout for monitored process [2024-10-13 05:59:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:22,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 05:59:22,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:22,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 05:59:22,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-10-13 05:59:22,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:22,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2024-10-13 05:59:22,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:22,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 50 [2024-10-13 05:59:22,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:22,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 38 [2024-10-13 05:59:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-13 05:59:22,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:59:22,958 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:22,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180148865] [2024-10-13 05:59:22,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180148865] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:59:22,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:59:22,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2024-10-13 05:59:22,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614958858] [2024-10-13 05:59:22,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:22,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:59:22,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:22,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:59:22,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-10-13 05:59:22,959 INFO L87 Difference]: Start difference. First operand 1128 states and 1590 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:23,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:23,269 INFO L93 Difference]: Finished difference Result 2300 states and 3238 transitions. [2024-10-13 05:59:23,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:59:23,270 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-10-13 05:59:23,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:23,273 INFO L225 Difference]: With dead ends: 2300 [2024-10-13 05:59:23,273 INFO L226 Difference]: Without dead ends: 1173 [2024-10-13 05:59:23,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2024-10-13 05:59:23,275 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 102 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:23,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1926 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:59:23,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2024-10-13 05:59:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1131. [2024-10-13 05:59:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 1059 states have (on average 1.4145420207743153) internal successors, (1498), 1062 states have internal predecessors, (1498), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:59:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1594 transitions. [2024-10-13 05:59:23,339 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1594 transitions. Word has length 120 [2024-10-13 05:59:23,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:23,339 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1594 transitions. [2024-10-13 05:59:23,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1594 transitions. [2024-10-13 05:59:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 05:59:23,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:23,341 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:23,352 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 (30)] Forceful destruction successful, exit code 0 [2024-10-13 05:59:23,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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 [2024-10-13 05:59:23,541 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:23,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:23,542 INFO L85 PathProgramCache]: Analyzing trace with hash 34595926, now seen corresponding path program 1 times [2024-10-13 05:59:23,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:23,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562482392] [2024-10-13 05:59:23,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:23,542 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 [2024-10-13 05:59:23,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:23,545 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2024-10-13 05:59:23,547 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 (31)] Waiting until timeout for monitored process [2024-10-13 05:59:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:23,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 05:59:23,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:23,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 05:59:23,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2024-10-13 05:59:23,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 05:59:23,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 64 [2024-10-13 05:59:23,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 4 [2024-10-13 05:59:24,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:24,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 51 [2024-10-13 05:59:24,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:24,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 42 [2024-10-13 05:59:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-13 05:59:24,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:59:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:59:24,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:24,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562482392] [2024-10-13 05:59:24,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562482392] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:59:24,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:59:24,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2024-10-13 05:59:24,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438286207] [2024-10-13 05:59:24,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:59:24,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 05:59:24,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:24,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 05:59:24,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:59:24,352 INFO L87 Difference]: Start difference. First operand 1131 states and 1594 transitions. Second operand has 12 states, 10 states have (on average 7.9) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-13 05:59:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:24,821 INFO L93 Difference]: Finished difference Result 2426 states and 3410 transitions. [2024-10-13 05:59:24,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 05:59:24,822 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.9) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 120 [2024-10-13 05:59:24,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:24,825 INFO L225 Difference]: With dead ends: 2426 [2024-10-13 05:59:24,825 INFO L226 Difference]: Without dead ends: 1296 [2024-10-13 05:59:24,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2024-10-13 05:59:24,827 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 419 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:24,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 838 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:59:24,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2024-10-13 05:59:24,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1129. [2024-10-13 05:59:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1057 states have (on average 1.412488174077578) internal successors, (1493), 1060 states have internal predecessors, (1493), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:59:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1589 transitions. [2024-10-13 05:59:24,897 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1589 transitions. Word has length 120 [2024-10-13 05:59:24,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:24,897 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1589 transitions. [2024-10-13 05:59:24,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.9) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-13 05:59:24,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1589 transitions. [2024-10-13 05:59:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 05:59:24,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:24,899 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:24,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2024-10-13 05:59:25,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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 [2024-10-13 05:59:25,099 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:25,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:25,100 INFO L85 PathProgramCache]: Analyzing trace with hash -67783584, now seen corresponding path program 1 times [2024-10-13 05:59:25,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:25,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268802620] [2024-10-13 05:59:25,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:25,100 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 [2024-10-13 05:59:25,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:25,101 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2024-10-13 05:59:25,102 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 (32)] Waiting until timeout for monitored process [2024-10-13 05:59:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:25,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 05:59:25,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:25,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 05:59:25,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-10-13 05:59:25,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:25,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2024-10-13 05:59:25,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:25,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 29 [2024-10-13 05:59:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-13 05:59:25,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:59:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:59:25,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:25,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268802620] [2024-10-13 05:59:25,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268802620] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:59:25,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:59:25,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2024-10-13 05:59:25,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172126165] [2024-10-13 05:59:25,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:59:25,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 05:59:25,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:25,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 05:59:25,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:59:25,839 INFO L87 Difference]: Start difference. First operand 1129 states and 1589 transitions. Second operand has 15 states, 13 states have (on average 7.0) internal successors, (91), 15 states have internal predecessors, (91), 5 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2024-10-13 05:59:26,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:26,543 INFO L93 Difference]: Finished difference Result 2603 states and 3588 transitions. [2024-10-13 05:59:26,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-13 05:59:26,543 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 15 states have internal predecessors, (91), 5 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) Word has length 120 [2024-10-13 05:59:26,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:26,557 INFO L225 Difference]: With dead ends: 2603 [2024-10-13 05:59:26,558 INFO L226 Difference]: Without dead ends: 1475 [2024-10-13 05:59:26,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=780, Unknown=0, NotChecked=0, Total=992 [2024-10-13 05:59:26,559 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 668 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:26,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1585 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:59:26,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2024-10-13 05:59:26,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1129. [2024-10-13 05:59:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1057 states have (on average 1.4068117313150426) internal successors, (1487), 1060 states have internal predecessors, (1487), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:59:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1583 transitions. [2024-10-13 05:59:26,631 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1583 transitions. Word has length 120 [2024-10-13 05:59:26,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:26,631 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1583 transitions. [2024-10-13 05:59:26,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.0) internal successors, (91), 15 states have internal predecessors, (91), 5 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2024-10-13 05:59:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1583 transitions. [2024-10-13 05:59:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 05:59:26,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:26,633 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:26,640 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 (32)] Ended with exit code 0 [2024-10-13 05:59:26,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /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 [2024-10-13 05:59:26,833 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:26,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:26,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1756727326, now seen corresponding path program 1 times [2024-10-13 05:59:26,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:26,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939617797] [2024-10-13 05:59:26,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:26,834 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 [2024-10-13 05:59:26,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:26,835 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2024-10-13 05:59:26,836 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 (33)] Waiting until timeout for monitored process [2024-10-13 05:59:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:27,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 05:59:27,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:27,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 05:59:27,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2024-10-13 05:59:27,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-10-13 05:59:27,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-13 05:59:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:27,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:27,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:27,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939617797] [2024-10-13 05:59:27,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939617797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:27,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:27,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:59:27,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494097806] [2024-10-13 05:59:27,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:27,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:59:27,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:27,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:59:27,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:59:27,186 INFO L87 Difference]: Start difference. First operand 1129 states and 1583 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:27,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:27,967 INFO L93 Difference]: Finished difference Result 2500 states and 3461 transitions. [2024-10-13 05:59:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:59:27,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-10-13 05:59:27,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:27,976 INFO L225 Difference]: With dead ends: 2500 [2024-10-13 05:59:27,977 INFO L226 Difference]: Without dead ends: 1372 [2024-10-13 05:59:27,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:59:27,978 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 142 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:27,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 642 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 05:59:27,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2024-10-13 05:59:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1015. [2024-10-13 05:59:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 943 states have (on average 1.40084835630965) internal successors, (1321), 946 states have internal predecessors, (1321), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:59:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1417 transitions. [2024-10-13 05:59:28,058 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1417 transitions. Word has length 120 [2024-10-13 05:59:28,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:28,058 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1417 transitions. [2024-10-13 05:59:28,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1417 transitions. [2024-10-13 05:59:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 05:59:28,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:28,060 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:28,068 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 (33)] Forceful destruction successful, exit code 0 [2024-10-13 05:59:28,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /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 [2024-10-13 05:59:28,261 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:28,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:28,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1286097524, now seen corresponding path program 1 times [2024-10-13 05:59:28,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:28,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504080147] [2024-10-13 05:59:28,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:28,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:59:28,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:28,263 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2024-10-13 05:59:28,263 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 (34)] Waiting until timeout for monitored process [2024-10-13 05:59:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:28,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 05:59:28,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:28,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-13 05:59:28,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-10-13 05:59:28,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2024-10-13 05:59:28,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2024-10-13 05:59:28,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:28,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 37 [2024-10-13 05:59:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-10-13 05:59:29,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:29,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:29,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504080147] [2024-10-13 05:59:29,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504080147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:29,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:29,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 05:59:29,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912478144] [2024-10-13 05:59:29,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:29,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 05:59:29,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:29,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 05:59:29,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:59:29,032 INFO L87 Difference]: Start difference. First operand 1015 states and 1417 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:59:31,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:31,495 INFO L93 Difference]: Finished difference Result 2306 states and 3166 transitions. [2024-10-13 05:59:31,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 05:59:31,496 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2024-10-13 05:59:31,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:31,499 INFO L225 Difference]: With dead ends: 2306 [2024-10-13 05:59:31,499 INFO L226 Difference]: Without dead ends: 1292 [2024-10-13 05:59:31,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:59:31,507 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 422 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:31,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1525 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1595 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 05:59:31,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2024-10-13 05:59:31,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 948. [2024-10-13 05:59:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 876 states have (on average 1.3961187214611872) internal successors, (1223), 879 states have internal predecessors, (1223), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:59:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1319 transitions. [2024-10-13 05:59:31,606 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1319 transitions. Word has length 120 [2024-10-13 05:59:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:31,607 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1319 transitions. [2024-10-13 05:59:31,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:59:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1319 transitions. [2024-10-13 05:59:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 05:59:31,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:31,608 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:31,616 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 (34)] Ended with exit code 0 [2024-10-13 05:59:31,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /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 [2024-10-13 05:59:31,809 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:31,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:31,809 INFO L85 PathProgramCache]: Analyzing trace with hash -113055046, now seen corresponding path program 1 times [2024-10-13 05:59:31,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:31,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135489229] [2024-10-13 05:59:31,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:31,809 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 [2024-10-13 05:59:31,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:31,810 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2024-10-13 05:59:31,811 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 (35)] Waiting until timeout for monitored process [2024-10-13 05:59:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:32,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 05:59:32,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-13 05:59:32,021 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:32,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:32,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135489229] [2024-10-13 05:59:32,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135489229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:32,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:32,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:59:32,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93574990] [2024-10-13 05:59:32,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:32,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:59:32,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:32,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:59:32,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:59:32,023 INFO L87 Difference]: Start difference. First operand 948 states and 1319 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:59:32,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:32,113 INFO L93 Difference]: Finished difference Result 1895 states and 2637 transitions. [2024-10-13 05:59:32,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:59:32,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2024-10-13 05:59:32,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:32,115 INFO L225 Difference]: With dead ends: 1895 [2024-10-13 05:59:32,115 INFO L226 Difference]: Without dead ends: 948 [2024-10-13 05:59:32,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:59:32,117 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:32,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 518 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:59:32,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2024-10-13 05:59:32,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2024-10-13 05:59:32,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 876 states have (on average 1.393835616438356) internal successors, (1221), 879 states have internal predecessors, (1221), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:59:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1317 transitions. [2024-10-13 05:59:32,188 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1317 transitions. Word has length 120 [2024-10-13 05:59:32,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:32,188 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1317 transitions. [2024-10-13 05:59:32,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:59:32,188 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1317 transitions. [2024-10-13 05:59:32,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 05:59:32,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:32,189 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:32,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2024-10-13 05:59:32,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /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 [2024-10-13 05:59:32,390 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:32,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:32,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1900170916, now seen corresponding path program 1 times [2024-10-13 05:59:32,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:32,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519550883] [2024-10-13 05:59:32,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:32,391 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 [2024-10-13 05:59:32,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:32,393 INFO L229 MonitoredProcess]: Starting monitored process 36 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) [2024-10-13 05:59:32,394 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 (36)] Waiting until timeout for monitored process [2024-10-13 05:59:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:32,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 05:59:32,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:32,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 05:59:32,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-13 05:59:32,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2024-10-13 05:59:32,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:32,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 35 [2024-10-13 05:59:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-13 05:59:32,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:59:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:33,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:33,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519550883] [2024-10-13 05:59:33,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519550883] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:59:33,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:59:33,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 15 [2024-10-13 05:59:33,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122764694] [2024-10-13 05:59:33,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:33,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:59:33,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:33,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:59:33,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:59:33,098 INFO L87 Difference]: Start difference. First operand 948 states and 1317 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:33,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:33,345 INFO L93 Difference]: Finished difference Result 1217 states and 1695 transitions. [2024-10-13 05:59:33,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 05:59:33,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-10-13 05:59:33,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:33,348 INFO L225 Difference]: With dead ends: 1217 [2024-10-13 05:59:33,349 INFO L226 Difference]: Without dead ends: 1215 [2024-10-13 05:59:33,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-13 05:59:33,349 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 96 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:33,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 999 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:59:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2024-10-13 05:59:33,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1188. [2024-10-13 05:59:33,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 1116 states have (on average 1.4041218637992832) internal successors, (1567), 1119 states have internal predecessors, (1567), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:59:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1663 transitions. [2024-10-13 05:59:33,442 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1663 transitions. Word has length 121 [2024-10-13 05:59:33,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:33,442 INFO L471 AbstractCegarLoop]: Abstraction has 1188 states and 1663 transitions. [2024-10-13 05:59:33,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:33,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1663 transitions. [2024-10-13 05:59:33,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 05:59:33,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:33,444 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:33,451 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 (36)] Ended with exit code 0 [2024-10-13 05:59:33,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /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 [2024-10-13 05:59:33,644 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:33,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:33,645 INFO L85 PathProgramCache]: Analyzing trace with hash -5381896, now seen corresponding path program 1 times [2024-10-13 05:59:33,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:33,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388796172] [2024-10-13 05:59:33,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:33,648 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 [2024-10-13 05:59:33,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:33,649 INFO L229 MonitoredProcess]: Starting monitored process 37 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) [2024-10-13 05:59:33,651 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 (37)] Waiting until timeout for monitored process [2024-10-13 05:59:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:33,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 05:59:33,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-13 05:59:33,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:33,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:33,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388796172] [2024-10-13 05:59:33,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388796172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:33,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:33,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:59:33,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785706558] [2024-10-13 05:59:33,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:33,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:59:33,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:33,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:59:33,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:59:33,901 INFO L87 Difference]: Start difference. First operand 1188 states and 1663 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-13 05:59:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:34,114 INFO L93 Difference]: Finished difference Result 2399 states and 3351 transitions. [2024-10-13 05:59:34,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:59:34,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2024-10-13 05:59:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:34,118 INFO L225 Difference]: With dead ends: 2399 [2024-10-13 05:59:34,118 INFO L226 Difference]: Without dead ends: 1208 [2024-10-13 05:59:34,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:59:34,121 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:34,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 761 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:59:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2024-10-13 05:59:34,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1188. [2024-10-13 05:59:34,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 1116 states have (on average 1.4023297491039426) internal successors, (1565), 1119 states have internal predecessors, (1565), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:59:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1661 transitions. [2024-10-13 05:59:34,204 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1661 transitions. Word has length 122 [2024-10-13 05:59:34,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:34,204 INFO L471 AbstractCegarLoop]: Abstraction has 1188 states and 1661 transitions. [2024-10-13 05:59:34,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-13 05:59:34,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1661 transitions. [2024-10-13 05:59:34,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 05:59:34,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:34,206 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:34,215 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 (37)] Ended with exit code 0 [2024-10-13 05:59:34,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /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 [2024-10-13 05:59:34,406 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:34,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:34,407 INFO L85 PathProgramCache]: Analyzing trace with hash 878127094, now seen corresponding path program 1 times [2024-10-13 05:59:34,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:34,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789521266] [2024-10-13 05:59:34,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:34,407 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 [2024-10-13 05:59:34,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:34,408 INFO L229 MonitoredProcess]: Starting monitored process 38 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) [2024-10-13 05:59:34,410 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 (38)] Waiting until timeout for monitored process [2024-10-13 05:59:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:34,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 05:59:34,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:34,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 05:59:34,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-13 05:59:34,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-10-13 05:59:34,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-13 05:59:35,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:35,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 52 [2024-10-13 05:59:35,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:35,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 45 [2024-10-13 05:59:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-10-13 05:59:35,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:35,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:35,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789521266] [2024-10-13 05:59:35,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789521266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:35,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:35,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 05:59:35,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144066746] [2024-10-13 05:59:35,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:35,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 05:59:35,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:35,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 05:59:35,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:59:35,196 INFO L87 Difference]: Start difference. First operand 1188 states and 1661 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-13 05:59:38,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:38,797 INFO L93 Difference]: Finished difference Result 3272 states and 4428 transitions. [2024-10-13 05:59:38,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 05:59:38,798 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2024-10-13 05:59:38,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:38,802 INFO L225 Difference]: With dead ends: 3272 [2024-10-13 05:59:38,802 INFO L226 Difference]: Without dead ends: 2085 [2024-10-13 05:59:38,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-10-13 05:59:38,804 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 1044 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:38,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 1684 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 05:59:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2024-10-13 05:59:38,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1283. [2024-10-13 05:59:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1211 states have (on average 1.4013212221304707) internal successors, (1697), 1214 states have internal predecessors, (1697), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:59:38,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1793 transitions. [2024-10-13 05:59:38,911 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1793 transitions. Word has length 122 [2024-10-13 05:59:38,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:38,911 INFO L471 AbstractCegarLoop]: Abstraction has 1283 states and 1793 transitions. [2024-10-13 05:59:38,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-13 05:59:38,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1793 transitions. [2024-10-13 05:59:38,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 05:59:38,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:38,913 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:38,920 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 (38)] Forceful destruction successful, exit code 0 [2024-10-13 05:59:39,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /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 [2024-10-13 05:59:39,113 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:39,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:39,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1300828920, now seen corresponding path program 1 times [2024-10-13 05:59:39,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:39,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030365227] [2024-10-13 05:59:39,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:39,114 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 [2024-10-13 05:59:39,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:39,115 INFO L229 MonitoredProcess]: Starting monitored process 39 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) [2024-10-13 05:59:39,116 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 (39)] Waiting until timeout for monitored process [2024-10-13 05:59:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:39,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 05:59:39,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:39,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-13 05:59:39,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-10-13 05:59:39,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-10-13 05:59:39,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-10-13 05:59:39,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:39,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 35 [2024-10-13 05:59:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-10-13 05:59:39,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:59:39,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:39,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030365227] [2024-10-13 05:59:39,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030365227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:59:39,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:59:39,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:59:39,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651685993] [2024-10-13 05:59:39,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:39,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:59:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:39,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:59:39,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:59:39,558 INFO L87 Difference]: Start difference. First operand 1283 states and 1793 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:59:40,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:40,215 INFO L93 Difference]: Finished difference Result 3184 states and 4422 transitions. [2024-10-13 05:59:40,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:59:40,216 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 122 [2024-10-13 05:59:40,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:40,219 INFO L225 Difference]: With dead ends: 3184 [2024-10-13 05:59:40,219 INFO L226 Difference]: Without dead ends: 1902 [2024-10-13 05:59:40,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:59:40,220 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 250 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:40,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1018 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:59:40,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2024-10-13 05:59:40,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1343. [2024-10-13 05:59:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1271 states have (on average 1.4067663257277734) internal successors, (1788), 1274 states have internal predecessors, (1788), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:59:40,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1884 transitions. [2024-10-13 05:59:40,316 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1884 transitions. Word has length 122 [2024-10-13 05:59:40,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:40,316 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 1884 transitions. [2024-10-13 05:59:40,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 05:59:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1884 transitions. [2024-10-13 05:59:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-13 05:59:40,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:40,318 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:40,325 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 (39)] Ended with exit code 0 [2024-10-13 05:59:40,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /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 [2024-10-13 05:59:40,519 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:40,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:40,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1998519937, now seen corresponding path program 1 times [2024-10-13 05:59:40,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:40,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572436813] [2024-10-13 05:59:40,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:40,520 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 [2024-10-13 05:59:40,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:40,521 INFO L229 MonitoredProcess]: Starting monitored process 40 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) [2024-10-13 05:59:40,522 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 (40)] Waiting until timeout for monitored process [2024-10-13 05:59:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:40,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 05:59:40,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:40,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-13 05:59:41,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-10-13 05:59:41,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2024-10-13 05:59:41,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:41,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 34 [2024-10-13 05:59:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 149 proven. 30 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-10-13 05:59:41,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:59:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:59:41,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:41,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572436813] [2024-10-13 05:59:41,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572436813] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:59:41,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:59:41,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2024-10-13 05:59:41,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663859811] [2024-10-13 05:59:41,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:59:41,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 05:59:41,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:41,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 05:59:41,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2024-10-13 05:59:41,831 INFO L87 Difference]: Start difference. First operand 1343 states and 1884 transitions. Second operand has 24 states, 22 states have (on average 5.318181818181818) internal successors, (117), 24 states have internal predecessors, (117), 6 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 6 states have call successors, (26) [2024-10-13 05:59:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:42,762 INFO L93 Difference]: Finished difference Result 1413 states and 1960 transitions. [2024-10-13 05:59:42,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 05:59:42,762 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 5.318181818181818) internal successors, (117), 24 states have internal predecessors, (117), 6 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 6 states have call successors, (26) Word has length 123 [2024-10-13 05:59:42,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:42,765 INFO L225 Difference]: With dead ends: 1413 [2024-10-13 05:59:42,765 INFO L226 Difference]: Without dead ends: 1411 [2024-10-13 05:59:42,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2024-10-13 05:59:42,766 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 999 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:42,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 1709 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:59:42,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2024-10-13 05:59:42,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1347. [2024-10-13 05:59:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1275 states have (on average 1.4070588235294117) internal successors, (1794), 1278 states have internal predecessors, (1794), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:59:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1890 transitions. [2024-10-13 05:59:42,864 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1890 transitions. Word has length 123 [2024-10-13 05:59:42,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:42,865 INFO L471 AbstractCegarLoop]: Abstraction has 1347 states and 1890 transitions. [2024-10-13 05:59:42,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 5.318181818181818) internal successors, (117), 24 states have internal predecessors, (117), 6 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 6 states have call successors, (26) [2024-10-13 05:59:42,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1890 transitions. [2024-10-13 05:59:42,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-13 05:59:42,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:42,866 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:42,874 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 (40)] Forceful destruction successful, exit code 0 [2024-10-13 05:59:43,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /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 [2024-10-13 05:59:43,067 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:43,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:43,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2110591799, now seen corresponding path program 1 times [2024-10-13 05:59:43,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:43,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034393090] [2024-10-13 05:59:43,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:43,068 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 [2024-10-13 05:59:43,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:43,069 INFO L229 MonitoredProcess]: Starting monitored process 41 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) [2024-10-13 05:59:43,070 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 (41)] Waiting until timeout for monitored process [2024-10-13 05:59:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:43,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 05:59:43,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:43,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-13 05:59:43,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-10-13 05:59:43,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-10-13 05:59:43,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:43,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 33 [2024-10-13 05:59:43,803 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 149 proven. 30 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-10-13 05:59:43,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:59:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:59:44,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:44,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034393090] [2024-10-13 05:59:44,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034393090] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:59:44,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:59:44,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2024-10-13 05:59:44,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334128195] [2024-10-13 05:59:44,139 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:59:44,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 05:59:44,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:44,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 05:59:44,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2024-10-13 05:59:44,140 INFO L87 Difference]: Start difference. First operand 1347 states and 1890 transitions. Second operand has 22 states, 20 states have (on average 5.85) internal successors, (117), 22 states have internal predecessors, (117), 6 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 6 states have call successors, (26) [2024-10-13 05:59:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:44,945 INFO L93 Difference]: Finished difference Result 1396 states and 1941 transitions. [2024-10-13 05:59:44,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 05:59:44,946 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 5.85) internal successors, (117), 22 states have internal predecessors, (117), 6 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 6 states have call successors, (26) Word has length 123 [2024-10-13 05:59:44,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:44,948 INFO L225 Difference]: With dead ends: 1396 [2024-10-13 05:59:44,948 INFO L226 Difference]: Without dead ends: 1394 [2024-10-13 05:59:44,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 05:59:44,949 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 162 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:44,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1352 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:59:44,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-10-13 05:59:45,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1347. [2024-10-13 05:59:45,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1275 states have (on average 1.4070588235294117) internal successors, (1794), 1278 states have internal predecessors, (1794), 48 states have call successors, (48), 23 states have call predecessors, (48), 23 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:59:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1890 transitions. [2024-10-13 05:59:45,053 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1890 transitions. Word has length 123 [2024-10-13 05:59:45,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:45,053 INFO L471 AbstractCegarLoop]: Abstraction has 1347 states and 1890 transitions. [2024-10-13 05:59:45,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 5.85) internal successors, (117), 22 states have internal predecessors, (117), 6 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 6 states have call successors, (26) [2024-10-13 05:59:45,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1890 transitions. [2024-10-13 05:59:45,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 05:59:45,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:45,055 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:45,063 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 (41)] Forceful destruction successful, exit code 0 [2024-10-13 05:59:45,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /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 [2024-10-13 05:59:45,256 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:45,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:45,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1325894273, now seen corresponding path program 1 times [2024-10-13 05:59:45,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:45,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67447943] [2024-10-13 05:59:45,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:45,257 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 [2024-10-13 05:59:45,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:45,260 INFO L229 MonitoredProcess]: Starting monitored process 42 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) [2024-10-13 05:59:45,260 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 (42)] Waiting until timeout for monitored process [2024-10-13 05:59:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:45,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 05:59:45,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:45,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 05:59:45,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-13 05:59:45,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-13 05:59:45,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:45,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 14 [2024-10-13 05:59:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-13 05:59:45,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:59:45,921 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:59:45,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:45,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67447943] [2024-10-13 05:59:45,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67447943] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:59:45,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:59:45,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2024-10-13 05:59:45,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6241336] [2024-10-13 05:59:45,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:59:45,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 05:59:45,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:45,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 05:59:45,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-13 05:59:45,922 INFO L87 Difference]: Start difference. First operand 1347 states and 1890 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-13 05:59:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:46,724 INFO L93 Difference]: Finished difference Result 3004 states and 4172 transitions. [2024-10-13 05:59:46,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-13 05:59:46,724 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 124 [2024-10-13 05:59:46,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:46,727 INFO L225 Difference]: With dead ends: 3004 [2024-10-13 05:59:46,728 INFO L226 Difference]: Without dead ends: 1658 [2024-10-13 05:59:46,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 233 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 05:59:46,729 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 178 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:46,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1120 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:59:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2024-10-13 05:59:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1471. [2024-10-13 05:59:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1359 states have (on average 1.3833701250919794) internal successors, (1880), 1365 states have internal predecessors, (1880), 75 states have call successors, (75), 36 states have call predecessors, (75), 36 states have return successors, (75), 69 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-13 05:59:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2030 transitions. [2024-10-13 05:59:46,902 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 2030 transitions. Word has length 124 [2024-10-13 05:59:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:46,903 INFO L471 AbstractCegarLoop]: Abstraction has 1471 states and 2030 transitions. [2024-10-13 05:59:46,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-13 05:59:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 2030 transitions. [2024-10-13 05:59:46,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-13 05:59:46,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:46,904 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:46,914 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 (42)] Forceful destruction successful, exit code 0 [2024-10-13 05:59:47,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /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 [2024-10-13 05:59:47,105 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:47,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:47,106 INFO L85 PathProgramCache]: Analyzing trace with hash -539142756, now seen corresponding path program 1 times [2024-10-13 05:59:47,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:47,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820726807] [2024-10-13 05:59:47,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:47,107 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 [2024-10-13 05:59:47,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:47,109 INFO L229 MonitoredProcess]: Starting monitored process 43 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) [2024-10-13 05:59:47,110 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 (43)] Waiting until timeout for monitored process [2024-10-13 05:59:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:47,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 05:59:47,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:47,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-13 05:59:47,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-10-13 05:59:47,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-10-13 05:59:47,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:47,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 28 [2024-10-13 05:59:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 149 proven. 30 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-10-13 05:59:47,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:59:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 05:59:48,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:48,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820726807] [2024-10-13 05:59:48,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820726807] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:59:48,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:59:48,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 22 [2024-10-13 05:59:48,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812406062] [2024-10-13 05:59:48,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:59:48,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 05:59:48,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:48,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 05:59:48,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-10-13 05:59:48,224 INFO L87 Difference]: Start difference. First operand 1471 states and 2030 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:48,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:48,732 INFO L93 Difference]: Finished difference Result 1838 states and 2535 transitions. [2024-10-13 05:59:48,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 05:59:48,733 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-10-13 05:59:48,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:48,736 INFO L225 Difference]: With dead ends: 1838 [2024-10-13 05:59:48,736 INFO L226 Difference]: Without dead ends: 1836 [2024-10-13 05:59:48,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2024-10-13 05:59:48,737 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 98 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:48,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 2171 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:59:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2024-10-13 05:59:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1774. [2024-10-13 05:59:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1662 states have (on average 1.3941034897713598) internal successors, (2317), 1668 states have internal predecessors, (2317), 75 states have call successors, (75), 36 states have call predecessors, (75), 36 states have return successors, (75), 69 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-13 05:59:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2467 transitions. [2024-10-13 05:59:48,902 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2467 transitions. Word has length 125 [2024-10-13 05:59:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:48,902 INFO L471 AbstractCegarLoop]: Abstraction has 1774 states and 2467 transitions. [2024-10-13 05:59:48,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 05:59:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2467 transitions. [2024-10-13 05:59:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-13 05:59:48,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:48,904 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:48,912 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 (43)] Forceful destruction successful, exit code 0 [2024-10-13 05:59:49,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /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 [2024-10-13 05:59:49,105 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:49,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:49,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1235864606, now seen corresponding path program 1 times [2024-10-13 05:59:49,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:49,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287054125] [2024-10-13 05:59:49,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:49,106 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 [2024-10-13 05:59:49,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:49,109 INFO L229 MonitoredProcess]: Starting monitored process 44 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) [2024-10-13 05:59:49,110 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 (44)] Waiting until timeout for monitored process [2024-10-13 05:59:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:49,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 05:59:49,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:49,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 47 [2024-10-13 05:59:49,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2024-10-13 05:59:49,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 05:59:49,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:49,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 82 [2024-10-13 05:59:49,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 05:59:49,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2024-10-13 05:59:49,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:49,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 45 [2024-10-13 05:59:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-13 05:59:49,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:59:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:59:49,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:49,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287054125] [2024-10-13 05:59:49,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287054125] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:59:49,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:59:49,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2024-10-13 05:59:49,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644832191] [2024-10-13 05:59:49,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:59:49,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 05:59:49,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:49,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 05:59:49,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:59:49,987 INFO L87 Difference]: Start difference. First operand 1774 states and 2467 transitions. Second operand has 13 states, 11 states have (on average 8.363636363636363) internal successors, (92), 13 states have internal predecessors, (92), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-13 05:59:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:59:50,896 INFO L93 Difference]: Finished difference Result 3788 states and 5223 transitions. [2024-10-13 05:59:50,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-13 05:59:50,896 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.363636363636363) internal successors, (92), 13 states have internal predecessors, (92), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 125 [2024-10-13 05:59:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:59:50,900 INFO L225 Difference]: With dead ends: 3788 [2024-10-13 05:59:50,900 INFO L226 Difference]: Without dead ends: 2140 [2024-10-13 05:59:50,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2024-10-13 05:59:50,904 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 625 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:59:50,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 1104 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:59:50,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2024-10-13 05:59:51,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1600. [2024-10-13 05:59:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1488 states have (on average 1.3891129032258065) internal successors, (2067), 1494 states have internal predecessors, (2067), 75 states have call successors, (75), 36 states have call predecessors, (75), 36 states have return successors, (75), 69 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-13 05:59:51,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2217 transitions. [2024-10-13 05:59:51,082 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2217 transitions. Word has length 125 [2024-10-13 05:59:51,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:59:51,083 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2217 transitions. [2024-10-13 05:59:51,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.363636363636363) internal successors, (92), 13 states have internal predecessors, (92), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-13 05:59:51,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2217 transitions. [2024-10-13 05:59:51,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-13 05:59:51,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:59:51,085 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:59:51,094 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 (44)] Ended with exit code 0 [2024-10-13 05:59:51,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /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 [2024-10-13 05:59:51,286 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:59:51,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:59:51,286 INFO L85 PathProgramCache]: Analyzing trace with hash -477103142, now seen corresponding path program 1 times [2024-10-13 05:59:51,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:59:51,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961286193] [2024-10-13 05:59:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:59:51,287 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 [2024-10-13 05:59:51,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:59:51,289 INFO L229 MonitoredProcess]: Starting monitored process 45 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) [2024-10-13 05:59:51,292 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 (45)] Waiting until timeout for monitored process [2024-10-13 05:59:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:59:51,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 05:59:51,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:59:51,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 47 [2024-10-13 05:59:51,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:59:51,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 25 [2024-10-13 05:59:51,675 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-13 05:59:51,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:59:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:59:51,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:59:51,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961286193] [2024-10-13 05:59:51,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961286193] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:59:51,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:59:51,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2024-10-13 05:59:51,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826233051] [2024-10-13 05:59:51,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:59:51,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 05:59:51,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:59:51,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 05:59:51,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:59:51,825 INFO L87 Difference]: Start difference. First operand 1600 states and 2217 transitions. Second operand has 12 states, 10 states have (on average 7.3) internal successors, (73), 12 states have internal predecessors, (73), 4 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25)