./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-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:17:28,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:17:28,906 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:17:28,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:17:28,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:17:28,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:17:28,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:17:28,923 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:17:28,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:17:28,924 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:17:28,924 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:17:28,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:17:28,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:17:28,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:17:28,925 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:17:28,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:17:28,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:17:28,926 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:17:28,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:17:28,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:17:28,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:17:28,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:17:28,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:17:28,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:17:28,928 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:17:28,929 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:17:28,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:17:28,929 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:17:28,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:17:28,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:17:28,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:17:28,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:17:28,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:17:28,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:17:28,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:17:28,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:17:28,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:17:28,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:17:28,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:17:28,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:17:28,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:17:28,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:17:28,933 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-clean/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-clean/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 -> b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 [2024-10-11 13:17:29,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:17:29,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:17:29,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:17:29,159 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:17:29,159 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:17:29,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-10-11 13:17:30,543 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:17:30,754 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:17:30,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-10-11 13:17:30,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/41b75cc37/b7d7255ecdbb41a38e0ae990023ffe88/FLAG1800c37d2 [2024-10-11 13:17:30,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/41b75cc37/b7d7255ecdbb41a38e0ae990023ffe88 [2024-10-11 13:17:30,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:17:30,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:17:30,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:17:30,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:17:30,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:17:30,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:17:30" (1/1) ... [2024-10-11 13:17:30,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402c5c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:30, skipping insertion in model container [2024-10-11 13:17:30,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:17:30" (1/1) ... [2024-10-11 13:17:30,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:17:30,932 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-48.i[916,929] [2024-10-11 13:17:30,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:17:30,989 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:17:30,998 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-48.i[916,929] [2024-10-11 13:17:31,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:17:31,043 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:17:31,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:31 WrapperNode [2024-10-11 13:17:31,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:17:31,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:17:31,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:17:31,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:17:31,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:31" (1/1) ... [2024-10-11 13:17:31,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:31" (1/1) ... [2024-10-11 13:17:31,118 INFO L138 Inliner]: procedures = 29, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2024-10-11 13:17:31,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:17:31,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:17:31,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:17:31,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:17:31,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:31" (1/1) ... [2024-10-11 13:17:31,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:31" (1/1) ... [2024-10-11 13:17:31,143 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:31" (1/1) ... [2024-10-11 13:17:31,174 INFO L175 MemorySlicer]: Split 143 memory accesses to 6 slices as follows [2, 15, 53, 5, 65, 3]. 45 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 2, 6, 1, 9, 1]. The 23 writes are split as follows [0, 3, 8, 1, 10, 1]. [2024-10-11 13:17:31,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:31" (1/1) ... [2024-10-11 13:17:31,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:31" (1/1) ... [2024-10-11 13:17:31,196 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:31" (1/1) ... [2024-10-11 13:17:31,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:31" (1/1) ... [2024-10-11 13:17:31,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:31" (1/1) ... [2024-10-11 13:17:31,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:31" (1/1) ... [2024-10-11 13:17:31,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:17:31,222 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:17:31,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:17:31,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:17:31,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:31" (1/1) ... [2024-10-11 13:17:31,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:17:31,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:17:31,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:17:31,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:17:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:17:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:17:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:17:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:17:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:17:31,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:17:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:17:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:17:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:17:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:17:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:17:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:17:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:17:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:17:31,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:17:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:17:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:17:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:17:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:17:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:17:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:17:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:17:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:17:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:17:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:17:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:17:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:17:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:17:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:17:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:17:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:17:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:17:31,306 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:17:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:17:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:17:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:17:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:17:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:17:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:17:31,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:17:31,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:17:31,428 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:17:31,429 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:17:31,827 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-11 13:17:31,827 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:17:31,862 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:17:31,863 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:17:31,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:17:31 BoogieIcfgContainer [2024-10-11 13:17:31,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:17:31,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:17:31,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:17:31,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:17:31,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:17:30" (1/3) ... [2024-10-11 13:17:31,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358cde47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:17:31, skipping insertion in model container [2024-10-11 13:17:31,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:31" (2/3) ... [2024-10-11 13:17:31,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358cde47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:17:31, skipping insertion in model container [2024-10-11 13:17:31,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:17:31" (3/3) ... [2024-10-11 13:17:31,872 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-48.i [2024-10-11 13:17:31,885 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:17:31,885 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:17:31,962 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:17:31,966 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;@52d4d722, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:17:31,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:17:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 88 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:17:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:17:31,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:31,987 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:31,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:31,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:31,995 INFO L85 PathProgramCache]: Analyzing trace with hash -941541902, now seen corresponding path program 1 times [2024-10-11 13:17:32,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:17:32,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109620287] [2024-10-11 13:17:32,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:32,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:17:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:17:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:17:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:17:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:17:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:17:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:17:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:17:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:17:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:17:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:17:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:17:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:17:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:17:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:17:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:17:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:17:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:17:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:17:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:17:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:17:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:17:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:17:32,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:17:32,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109620287] [2024-10-11 13:17:32,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109620287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:32,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:32,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:17:32,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400032421] [2024-10-11 13:17:32,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:32,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:17:32,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:17:32,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:17:32,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:17:32,424 INFO L87 Difference]: Start difference. First operand has 111 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 88 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:17:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:32,477 INFO L93 Difference]: Finished difference Result 219 states and 351 transitions. [2024-10-11 13:17:32,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:17:32,483 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2024-10-11 13:17:32,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:32,520 INFO L225 Difference]: With dead ends: 219 [2024-10-11 13:17:32,520 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 13:17:32,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-11 13:17:32,543 INFO L432 NwaCegarLoop]: 155 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, 155 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-11 13:17:32,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:17:32,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 13:17:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-11 13:17:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:17:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2024-10-11 13:17:32,655 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 163 [2024-10-11 13:17:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:32,655 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2024-10-11 13:17:32,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:17:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2024-10-11 13:17:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:17:32,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:32,662 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:32,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:17:32,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:32,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:32,663 INFO L85 PathProgramCache]: Analyzing trace with hash 245893272, now seen corresponding path program 1 times [2024-10-11 13:17:32,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:17:32,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421081097] [2024-10-11 13:17:32,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:32,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:17:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:17:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:17:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:17:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:17:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:17:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:17:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:17:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:17:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:17:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:17:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:17:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:17:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:17:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:17:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:17:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:17:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:17:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:17:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:17:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:17:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:17:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:17:33,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:17:33,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421081097] [2024-10-11 13:17:33,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421081097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:33,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:33,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:17:33,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531563142] [2024-10-11 13:17:33,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:33,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:17:33,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:17:33,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:17:33,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:17:33,145 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:17:33,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:33,194 INFO L93 Difference]: Finished difference Result 219 states and 320 transitions. [2024-10-11 13:17:33,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:17:33,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2024-10-11 13:17:33,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:33,196 INFO L225 Difference]: With dead ends: 219 [2024-10-11 13:17:33,196 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 13:17:33,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-11 13:17:33,198 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:33,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:17:33,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 13:17:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 13:17:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:17:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2024-10-11 13:17:33,208 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 163 [2024-10-11 13:17:33,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:33,209 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2024-10-11 13:17:33,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:17:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2024-10-11 13:17:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:17:33,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:33,211 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:33,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:17:33,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:33,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:33,212 INFO L85 PathProgramCache]: Analyzing trace with hash -139969130, now seen corresponding path program 1 times [2024-10-11 13:17:33,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:17:33,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886147311] [2024-10-11 13:17:33,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:33,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:17:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:17:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:17:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:17:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:17:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:17:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:17:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:17:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:17:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:17:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:17:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:17:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:17:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:17:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:17:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:17:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:17:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:17:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:17:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:17:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:17:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:17:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:17:33,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:17:33,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886147311] [2024-10-11 13:17:33,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886147311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:33,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:33,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:17:33,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855824704] [2024-10-11 13:17:33,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:33,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:17:33,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:17:33,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:17:33,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:17:33,492 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:17:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:33,538 INFO L93 Difference]: Finished difference Result 224 states and 325 transitions. [2024-10-11 13:17:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:17:33,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-11 13:17:33,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:33,541 INFO L225 Difference]: With dead ends: 224 [2024-10-11 13:17:33,543 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 13:17:33,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-11 13:17:33,544 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:33,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 449 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:17:33,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 13:17:33,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-11 13:17:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:17:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-10-11 13:17:33,558 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 163 [2024-10-11 13:17:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:33,559 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-10-11 13:17:33,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:17:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-10-11 13:17:33,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:17:33,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:33,564 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:33,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:17:33,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:33,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:33,565 INFO L85 PathProgramCache]: Analyzing trace with hash -949315756, now seen corresponding path program 1 times [2024-10-11 13:17:33,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:17:33,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091093194] [2024-10-11 13:17:33,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:33,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:17:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:17:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:17:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:17:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:17:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:17:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:17:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:17:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:17:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:17:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:17:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:17:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:17:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:17:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:17:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:17:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:17:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:17:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:17:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:17:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:17:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:17:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:17:33,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:17:33,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091093194] [2024-10-11 13:17:33,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091093194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:33,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:33,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:17:33,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771856014] [2024-10-11 13:17:33,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:33,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:17:33,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:17:33,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:17:33,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:17:33,747 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:17:33,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:33,777 INFO L93 Difference]: Finished difference Result 228 states and 329 transitions. [2024-10-11 13:17:33,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:17:33,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-11 13:17:33,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:33,781 INFO L225 Difference]: With dead ends: 228 [2024-10-11 13:17:33,781 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 13:17:33,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-11 13:17:33,782 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:33,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 450 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:17:33,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 13:17:33,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-10-11 13:17:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:17:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2024-10-11 13:17:33,795 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 163 [2024-10-11 13:17:33,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:33,796 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2024-10-11 13:17:33,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:17:33,796 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2024-10-11 13:17:33,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:17:33,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:33,798 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:33,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:17:33,798 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:33,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:33,798 INFO L85 PathProgramCache]: Analyzing trace with hash -892057454, now seen corresponding path program 1 times [2024-10-11 13:17:33,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:17:33,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917534896] [2024-10-11 13:17:33,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:33,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:17:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:17:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:17:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:17:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:17:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:17:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:17:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:17:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:17:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:17:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:17:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:17:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:17:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:17:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:17:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:17:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:17:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:17:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:17:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:17:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:17:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:17:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:17:33,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:17:33,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917534896] [2024-10-11 13:17:33,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917534896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:33,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:33,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:17:33,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536614236] [2024-10-11 13:17:33,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:33,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:17:33,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:17:33,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:17:33,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:17:33,947 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:17:33,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:33,975 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2024-10-11 13:17:33,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:17:33,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-11 13:17:33,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:33,978 INFO L225 Difference]: With dead ends: 232 [2024-10-11 13:17:33,978 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 13:17:33,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-11 13:17:33,979 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:33,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 453 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:17:33,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 13:17:33,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-10-11 13:17:33,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:17:33,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2024-10-11 13:17:33,990 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 163 [2024-10-11 13:17:33,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:33,990 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2024-10-11 13:17:33,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:17:33,991 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2024-10-11 13:17:33,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:17:33,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:33,992 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:33,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:17:33,992 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:33,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:33,992 INFO L85 PathProgramCache]: Analyzing trace with hash -891997872, now seen corresponding path program 1 times [2024-10-11 13:17:33,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:17:33,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824790484] [2024-10-11 13:17:33,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:33,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:17:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:17:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:17:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:17:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:17:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:17:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:17:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:17:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:17:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:17:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:17:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:17:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:17:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:17:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:17:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:17:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:17:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:17:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:17:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:17:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:17:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:17:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:34,980 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:17:34,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:17:34,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824790484] [2024-10-11 13:17:34,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824790484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:34,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:34,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:17:34,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138734295] [2024-10-11 13:17:34,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:34,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:17:34,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:17:34,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:17:34,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:17:34,983 INFO L87 Difference]: Start difference. First operand 117 states and 167 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:17:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:35,040 INFO L93 Difference]: Finished difference Result 233 states and 333 transitions. [2024-10-11 13:17:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:17:35,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2024-10-11 13:17:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:35,042 INFO L225 Difference]: With dead ends: 233 [2024-10-11 13:17:35,042 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 13:17:35,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 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-11 13:17:35,044 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:35,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 426 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:17:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 13:17:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-11 13:17:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 94 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:17:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-10-11 13:17:35,057 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 163 [2024-10-11 13:17:35,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:35,057 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-10-11 13:17:35,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:17:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-10-11 13:17:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:17:35,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:35,059 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:35,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:17:35,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:35,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:35,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1408824718, now seen corresponding path program 1 times [2024-10-11 13:17:35,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:17:35,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800798253] [2024-10-11 13:17:35,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:35,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:17:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:17:35,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:17:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:17:35,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:17:35,457 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:17:35,458 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:17:35,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:17:35,466 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:17:35,571 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:17:35,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:17:35 BoogieIcfgContainer [2024-10-11 13:17:35,574 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:17:35,574 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:17:35,574 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:17:35,574 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:17:35,575 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:17:31" (3/4) ... [2024-10-11 13:17:35,576 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:17:35,577 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:17:35,578 INFO L158 Benchmark]: Toolchain (without parser) took 4794.14ms. Allocated memory was 213.9MB in the beginning and 287.3MB in the end (delta: 73.4MB). Free memory was 182.3MB in the beginning and 113.2MB in the end (delta: 69.0MB). Peak memory consumption was 143.0MB. Max. memory is 16.1GB. [2024-10-11 13:17:35,578 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:17:35,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.71ms. Allocated memory is still 213.9MB. Free memory was 182.0MB in the beginning and 169.5MB in the end (delta: 12.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:17:35,579 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.27ms. Allocated memory is still 213.9MB. Free memory was 169.5MB in the beginning and 165.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:17:35,579 INFO L158 Benchmark]: Boogie Preprocessor took 94.05ms. Allocated memory is still 213.9MB. Free memory was 165.3MB in the beginning and 159.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 13:17:35,579 INFO L158 Benchmark]: RCFGBuilder took 642.33ms. Allocated memory is still 213.9MB. Free memory was 159.0MB in the beginning and 119.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-11 13:17:35,579 INFO L158 Benchmark]: TraceAbstraction took 3707.16ms. Allocated memory was 213.9MB in the beginning and 287.3MB in the end (delta: 73.4MB). Free memory was 119.2MB in the beginning and 114.3MB in the end (delta: 4.9MB). Peak memory consumption was 78.0MB. Max. memory is 16.1GB. [2024-10-11 13:17:35,579 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 287.3MB. Free memory was 114.3MB in the beginning and 113.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:17:35,581 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.13ms. Allocated memory is still 130.0MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.71ms. Allocated memory is still 213.9MB. Free memory was 182.0MB in the beginning and 169.5MB in the end (delta: 12.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.27ms. Allocated memory is still 213.9MB. Free memory was 169.5MB in the beginning and 165.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.05ms. Allocated memory is still 213.9MB. Free memory was 165.3MB in the beginning and 159.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 642.33ms. Allocated memory is still 213.9MB. Free memory was 159.0MB in the beginning and 119.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3707.16ms. Allocated memory was 213.9MB in the beginning and 287.3MB in the end (delta: 73.4MB). Free memory was 119.2MB in the beginning and 114.3MB in the end (delta: 4.9MB). Peak memory consumption was 78.0MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 287.3MB. Free memory was 114.3MB in the beginning and 113.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L25-L27] float float_Array_0[2][3] = { {9.25, 128.75, 255.675}, {4.5, 5.5, 32.8} }; [L28-L30] signed long int signed_long_int_Array_0[1] = { 64 }; [L28-L30] signed long int signed_long_int_Array_0[1] = { 64 }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L31-L33] unsigned char unsigned_char_Array_0[3][3] = { {8, 5, 100}, {4, 200, 64}, {100, 200, 2} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 1 }; [L37] unsigned char last_1_unsigned_char_Array_0_0__1_ = 5; [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR unsigned_char_Array_0[0][1] [L104] last_1_unsigned_char_Array_0_0__1_ = unsigned_char_Array_0[0][1] [L114] RET updateLastVariables() [L115] CALL updateVariables() [L68] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] float_Array_0[0][0] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0][0] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F [L72] EXPR float_Array_0[0][0] [L72] EXPR float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854765600e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854765600e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] float_Array_0[1][0] = __VERIFIER_nondet_float() [L74] EXPR float_Array_0[1][0] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F [L74] EXPR float_Array_0[1][0] [L74] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] CALL assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] RET assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] float_Array_0[0][1] = __VERIFIER_nondet_float() [L76] EXPR float_Array_0[0][1] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L76] EXPR float_Array_0[0][1] [L76] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] float_Array_0[1][1] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[1][1] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F [L78] EXPR float_Array_0[1][1] [L78] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] float_Array_0[0][2] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0][2] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F [L80] EXPR float_Array_0[0][2] [L80] EXPR float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[0][2] >= -922337.2036854776000e+13F && float_Array_0[0][2] <= -1.0e-20F) || (float_Array_0[0][2] <= 9223372.036854776000e+12F && float_Array_0[0][2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] CALL assume_abort_if_not(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, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] EXPR unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L85] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 190) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 190) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] unsigned_char_Array_0[2][1] = __VERIFIER_nondet_uchar() [L91] EXPR unsigned_char_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[2][1] >= 191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[2][1] >= 191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] EXPR unsigned_char_Array_0[2][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[2][1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[2][1] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[0][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[0][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L97] EXPR unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[1][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[1][2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] EXPR unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[1][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[1][2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L99] unsigned_char_Array_0[2][2] = __VERIFIER_nondet_uchar() [L100] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] CALL assume_abort_if_not(unsigned_char_Array_0[2][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L100] RET assume_abort_if_not(unsigned_char_Array_0[2][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] CALL assume_abort_if_not(unsigned_char_Array_0[2][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L101] RET assume_abort_if_not(unsigned_char_Array_0[2][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L115] RET updateVariables() [L116] CALL step() [L41] EXPR float_Array_0[0][2] [L41] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L41] COND FALSE !(float_Array_0[0][2] <= float_Array_0[1][1]) [L48] EXPR float_Array_0[0][0] [L48] float_Array_0[1][2] = float_Array_0[0][0] [L50] EXPR unsigned_char_Array_0[0][2] [L50] unsigned_long_int_Array_0[0] = unsigned_char_Array_0[0][2] [L51] EXPR unsigned_char_Array_0[2][1] [L51] signed_long_int_Array_0[0] = unsigned_char_Array_0[2][1] [L52] unsigned_char_Array_0[2][0] = 4 [L53] EXPR signed_long_int_Array_0[0] [L53] signed long int stepLocal_0 = signed_long_int_Array_0[0]; [L54] EXPR unsigned_char_Array_0[2][1] [L54] EXPR unsigned_char_Array_0[0][0] [L54] EXPR unsigned_char_Array_0[2][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L54] COND FALSE !(((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > stepLocal_0) [L57] EXPR BOOL_unsigned_char_Array_0[1] [L57] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L59] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L59] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR float_Array_0[0][2] [L107] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0])) [L107] EXPR float_Array_0[1][2] [L107] EXPR float_Array_0[0][0] [L107] EXPR (float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR (((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107] EXPR ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L107-L108] return ((((((float_Array_0[0][2] <= float_Array_0[1][1]) ? ((float_Array_0[1][1] < ((float_Array_0[0][1] - float_Array_0[1][0]) + 1.395f)) ? (float_Array_0[1][2] == ((float) float_Array_0[0][0])) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) : (float_Array_0[1][2] == ((float) float_Array_0[0][0]))) && (BOOL_unsigned_char_Array_0[0] ? ((last_1_unsigned_char_Array_0_0__1_ != last_1_unsigned_char_Array_0_0__1_) ? (unsigned_char_Array_0[0][1] == ((unsigned char) ((unsigned_char_Array_0[1][1] - unsigned_char_Array_0[0][0]) - unsigned_char_Array_0[1][0]))) : (unsigned_char_Array_0[0][1] == ((unsigned char) (unsigned_char_Array_0[1][1] - (((((unsigned_char_Array_0[0][2]) > (unsigned_char_Array_0[1][2])) ? (unsigned_char_Array_0[0][2]) : (unsigned_char_Array_0[1][2]))) - unsigned_char_Array_0[0][0]))))) : 1)) && ((((unsigned_char_Array_0[2][1] - unsigned_char_Array_0[0][0]) - (8 + unsigned_char_Array_0[2][2])) > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0][2]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[2][1]))) && (unsigned_char_Array_0[2][0] == ((unsigned char) 4)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=5, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 2385 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1468 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 146 IncrementalHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 917 mSDtfsCounter, 146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=5, InterpolantAutomatonStates: 22, 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, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1141 NumberOfCodeBlocks, 1141 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 972 ConstructedInterpolants, 0 QuantifiedInterpolants, 997 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 5040/5040 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-11 13:17:35,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:17:38,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:17:38,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:17:38,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:17:38,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:17:38,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:17:38,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:17:38,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:17:38,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:17:38,148 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:17:38,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:17:38,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:17:38,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:17:38,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:17:38,150 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:17:38,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:17:38,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:17:38,150 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:17:38,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:17:38,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:17:38,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:17:38,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:17:38,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:17:38,156 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:17:38,156 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:17:38,156 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:17:38,156 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:17:38,157 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:17:38,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:17:38,157 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:17:38,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:17:38,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:17:38,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:17:38,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:17:38,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:17:38,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:17:38,159 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:17:38,160 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:17:38,160 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:17:38,160 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:17:38,160 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:17:38,161 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:17:38,161 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:17:38,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:17:38,161 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:17:38,161 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-clean/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-clean/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 -> b209b13322483f0de6355983dfc45de7dda6e23f708a5a679f61eb11dccb6a42 [2024-10-11 13:17:38,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:17:38,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:17:38,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:17:38,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:17:38,464 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:17:38,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-10-11 13:17:39,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:17:40,061 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:17:40,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-48.i [2024-10-11 13:17:40,073 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ff9a5118c/63ae6dd55b2a46db829b1b93978730ad/FLAG7b5587e8f [2024-10-11 13:17:40,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ff9a5118c/63ae6dd55b2a46db829b1b93978730ad [2024-10-11 13:17:40,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:17:40,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:17:40,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:17:40,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:17:40,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:17:40,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:17:40" (1/1) ... [2024-10-11 13:17:40,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1766d420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:40, skipping insertion in model container [2024-10-11 13:17:40,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:17:40" (1/1) ... [2024-10-11 13:17:40,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:17:40,596 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-48.i[916,929] [2024-10-11 13:17:40,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:17:40,684 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:17:40,692 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-48.i[916,929] [2024-10-11 13:17:40,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:17:40,796 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:17:40,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:40 WrapperNode [2024-10-11 13:17:40,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:17:40,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:17:40,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:17:40,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:17:40,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:40" (1/1) ... [2024-10-11 13:17:40,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:40" (1/1) ... [2024-10-11 13:17:40,863 INFO L138 Inliner]: procedures = 33, calls = 180, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2024-10-11 13:17:40,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:17:40,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:17:40,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:17:40,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:17:40,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:40" (1/1) ... [2024-10-11 13:17:40,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:40" (1/1) ... [2024-10-11 13:17:40,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:40" (1/1) ... [2024-10-11 13:17:40,904 INFO L175 MemorySlicer]: Split 143 memory accesses to 6 slices as follows [2, 15, 53, 5, 65, 3]. 45 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 2, 6, 1, 9, 1]. The 23 writes are split as follows [0, 3, 8, 1, 10, 1]. [2024-10-11 13:17:40,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:40" (1/1) ... [2024-10-11 13:17:40,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:40" (1/1) ... [2024-10-11 13:17:40,928 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:40" (1/1) ... [2024-10-11 13:17:40,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:40" (1/1) ... [2024-10-11 13:17:40,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:40" (1/1) ... [2024-10-11 13:17:40,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:40" (1/1) ... [2024-10-11 13:17:40,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:17:40,943 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:17:40,944 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:17:40,944 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:17:40,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:40" (1/1) ... [2024-10-11 13:17:40,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:17:40,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:17:40,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:17:40,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:17:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:17:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:17:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:17:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 13:17:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 13:17:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 13:17:41,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 13:17:41,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:17:41,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:17:41,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 13:17:41,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 13:17:41,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 13:17:41,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 13:17:41,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:17:41,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:17:41,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 13:17:41,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-11 13:17:41,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-11 13:17:41,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-11 13:17:41,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:17:41,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:17:41,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 13:17:41,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 13:17:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 13:17:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-11 13:17:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:17:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:17:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 13:17:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 13:17:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-11 13:17:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-11 13:17:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:17:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:17:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 13:17:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 13:17:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 13:17:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-11 13:17:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:17:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:17:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-11 13:17:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-11 13:17:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-11 13:17:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-11 13:17:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:17:41,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:17:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:17:41,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:17:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:17:41,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:17:41,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 13:17:41,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 13:17:41,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 13:17:41,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 13:17:41,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:17:41,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:17:41,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 13:17:41,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 13:17:41,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-11 13:17:41,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-11 13:17:41,152 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:17:41,154 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:17:42,268 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-11 13:17:42,269 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:17:42,317 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:17:42,317 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:17:42,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:17:42 BoogieIcfgContainer [2024-10-11 13:17:42,318 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:17:42,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:17:42,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:17:42,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:17:42,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:17:40" (1/3) ... [2024-10-11 13:17:42,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664d8f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:17:42, skipping insertion in model container [2024-10-11 13:17:42,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:17:40" (2/3) ... [2024-10-11 13:17:42,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664d8f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:17:42, skipping insertion in model container [2024-10-11 13:17:42,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:17:42" (3/3) ... [2024-10-11 13:17:42,324 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-48.i [2024-10-11 13:17:42,336 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:17:42,337 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:17:42,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:17:42,396 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;@4b6a8a8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:17:42,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:17:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 88 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:17:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:17:42,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:42,416 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:42,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:42,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:42,422 INFO L85 PathProgramCache]: Analyzing trace with hash -941541902, now seen corresponding path program 1 times [2024-10-11 13:17:42,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:17:42,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774858986] [2024-10-11 13:17:42,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:42,436 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-11 13:17:42,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:17:42,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:42,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:42,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:17:42,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2024-10-11 13:17:42,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:17:42,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:17:42,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774858986] [2024-10-11 13:17:42,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774858986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:42,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:42,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:17:42,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451551038] [2024-10-11 13:17:42,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:42,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:17:42,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:17:42,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:17:42,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:17:42,882 INFO L87 Difference]: Start difference. First operand has 111 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 88 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:17:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:42,939 INFO L93 Difference]: Finished difference Result 219 states and 351 transitions. [2024-10-11 13:17:42,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:17:42,941 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2024-10-11 13:17:42,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:42,949 INFO L225 Difference]: With dead ends: 219 [2024-10-11 13:17:42,949 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 13:17:42,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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-11 13:17:42,956 INFO L432 NwaCegarLoop]: 155 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, 155 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-11 13:17:42,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:17:42,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 13:17:42,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-11 13:17:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:17:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2024-10-11 13:17:42,997 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 163 [2024-10-11 13:17:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:42,999 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2024-10-11 13:17:43,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:17:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2024-10-11 13:17:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:17:43,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:43,004 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:43,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:17:43,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:43,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:43,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:43,211 INFO L85 PathProgramCache]: Analyzing trace with hash 245893272, now seen corresponding path program 1 times [2024-10-11 13:17:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:17:43,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731544089] [2024-10-11 13:17:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:43,212 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-11 13:17:43,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:17:43,215 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:43,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:43,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:17:43,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-10-11 13:17:43,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:17:43,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:17:43,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731544089] [2024-10-11 13:17:43,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731544089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:43,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:43,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:17:43,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597587731] [2024-10-11 13:17:43,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:43,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:17:43,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:17:43,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:17:43,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:17:43,527 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:17:43,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:43,569 INFO L93 Difference]: Finished difference Result 219 states and 320 transitions. [2024-10-11 13:17:43,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:17:43,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2024-10-11 13:17:43,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:43,571 INFO L225 Difference]: With dead ends: 219 [2024-10-11 13:17:43,571 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 13:17:43,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 160 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-11 13:17:43,573 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:43,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:17:43,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 13:17:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 13:17:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:17:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2024-10-11 13:17:43,581 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 163 [2024-10-11 13:17:43,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:43,582 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2024-10-11 13:17:43,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:17:43,582 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2024-10-11 13:17:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:17:43,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:43,584 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:43,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:43,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:43,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:43,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash -139969130, now seen corresponding path program 1 times [2024-10-11 13:17:43,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:17:43,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490816336] [2024-10-11 13:17:43,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:43,791 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-11 13:17:43,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:17:43,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:43,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:44,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:17:44,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:44,433 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 66 treesize of output 48 [2024-10-11 13:17:44,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:17:44,438 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 48 treesize of output 62 [2024-10-11 13:17:44,496 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 19 treesize of output 4 [2024-10-11 13:17:44,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:17:44,529 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 27 treesize of output 13 [2024-10-11 13:17:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 98 proven. 57 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-10-11 13:17:44,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:17:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-11 13:17:44,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:17:44,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490816336] [2024-10-11 13:17:44,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490816336] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:17:44,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:17:44,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-10-11 13:17:44,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391254290] [2024-10-11 13:17:44,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:17:44,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:17:44,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:17:44,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:17:44,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:17:44,942 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 states have internal predecessors, (74), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2024-10-11 13:17:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:45,847 INFO L93 Difference]: Finished difference Result 347 states and 495 transitions. [2024-10-11 13:17:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 13:17:45,848 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 states have internal predecessors, (74), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) Word has length 163 [2024-10-11 13:17:45,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:45,851 INFO L225 Difference]: With dead ends: 347 [2024-10-11 13:17:45,851 INFO L226 Difference]: Without dead ends: 237 [2024-10-11 13:17:45,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2024-10-11 13:17:45,853 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 331 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:45,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1094 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:17:45,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-11 13:17:45,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 117. [2024-10-11 13:17:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:17:45,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2024-10-11 13:17:45,874 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 163 [2024-10-11 13:17:45,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:45,875 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2024-10-11 13:17:45,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 13 states have internal predecessors, (74), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2024-10-11 13:17:45,875 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2024-10-11 13:17:45,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:17:45,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:45,878 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:45,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Ended with exit code 0 [2024-10-11 13:17:46,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:46,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:46,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:46,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2134113836, now seen corresponding path program 1 times [2024-10-11 13:17:46,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:17:46,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860422884] [2024-10-11 13:17:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:46,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:17:46,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:17:46,089 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:46,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:46,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:17:46,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:17:46,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:17:46,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:17:46,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860422884] [2024-10-11 13:17:46,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860422884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:46,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:46,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:17:46,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606139081] [2024-10-11 13:17:46,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:46,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:17:46,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:17:46,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:17:46,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:17:46,464 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:17:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:46,522 INFO L93 Difference]: Finished difference Result 238 states and 338 transitions. [2024-10-11 13:17:46,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:17:46,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-11 13:17:46,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:46,524 INFO L225 Difference]: With dead ends: 238 [2024-10-11 13:17:46,525 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 13:17:46,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 159 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-11 13:17:46,526 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:46,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 590 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:17:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 13:17:46,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2024-10-11 13:17:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 97 states have internal predecessors, (128), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:17:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 170 transitions. [2024-10-11 13:17:46,551 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 170 transitions. Word has length 163 [2024-10-11 13:17:46,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:46,552 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 170 transitions. [2024-10-11 13:17:46,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:17:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 170 transitions. [2024-10-11 13:17:46,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:17:46,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:46,554 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:46,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:46,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:46,755 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:46,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:46,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1351506834, now seen corresponding path program 1 times [2024-10-11 13:17:46,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:17:46,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69823506] [2024-10-11 13:17:46,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:46,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:17:46,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:17:46,760 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:46,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:47,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:17:47,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:47,096 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:17:47,097 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:17:47,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:17:47,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69823506] [2024-10-11 13:17:47,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69823506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:47,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:47,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:17:47,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597879377] [2024-10-11 13:17:47,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:47,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:17:47,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:17:47,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:17:47,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:17:47,100 INFO L87 Difference]: Start difference. First operand 121 states and 170 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:17:47,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:47,173 INFO L93 Difference]: Finished difference Result 244 states and 343 transitions. [2024-10-11 13:17:47,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:17:47,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-11 13:17:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:47,175 INFO L225 Difference]: With dead ends: 244 [2024-10-11 13:17:47,175 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 13:17:47,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:17:47,177 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:47,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 728 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:17:47,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 13:17:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-10-11 13:17:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:17:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 172 transitions. [2024-10-11 13:17:47,188 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 172 transitions. Word has length 163 [2024-10-11 13:17:47,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:47,189 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 172 transitions. [2024-10-11 13:17:47,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:17:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 172 transitions. [2024-10-11 13:17:47,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:17:47,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:47,191 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:47,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 13:17:47,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:47,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:47,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:47,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1408765136, now seen corresponding path program 1 times [2024-10-11 13:17:47,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:17:47,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114500479] [2024-10-11 13:17:47,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:47,394 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-11 13:17:47,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:17:47,398 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:47,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:47,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:17:47,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:17:47,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:17:47,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:17:47,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114500479] [2024-10-11 13:17:47,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114500479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:47,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:47,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:17:47,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557288028] [2024-10-11 13:17:47,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:47,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:17:47,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:17:47,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:17:47,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:17:47,806 INFO L87 Difference]: Start difference. First operand 123 states and 172 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:17:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:47,896 INFO L93 Difference]: Finished difference Result 248 states and 347 transitions. [2024-10-11 13:17:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:17:47,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-10-11 13:17:47,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:47,898 INFO L225 Difference]: With dead ends: 248 [2024-10-11 13:17:47,898 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 13:17:47,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:17:47,899 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:47,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 868 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:17:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 13:17:47,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2024-10-11 13:17:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.306930693069307) internal successors, (132), 101 states have internal predecessors, (132), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:17:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 174 transitions. [2024-10-11 13:17:47,910 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 174 transitions. Word has length 163 [2024-10-11 13:17:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:47,910 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 174 transitions. [2024-10-11 13:17:47,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:17:47,911 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 174 transitions. [2024-10-11 13:17:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:17:47,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:47,913 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:47,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:48,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:48,114 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:48,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:48,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1408824718, now seen corresponding path program 1 times [2024-10-11 13:17:48,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:17:48,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590089272] [2024-10-11 13:17:48,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:48,116 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-11 13:17:48,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:17:48,118 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:48,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:48,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:17:48,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:48,473 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 95 treesize of output 41 [2024-10-11 13:17:48,493 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-10-11 13:17:48,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:17:48,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:17:48,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590089272] [2024-10-11 13:17:48,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590089272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:48,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:48,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:17:48,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788765836] [2024-10-11 13:17:48,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:48,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:17:48,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:17:48,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:17:48,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:17:48,496 INFO L87 Difference]: Start difference. First operand 125 states and 174 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:17:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:49,721 INFO L93 Difference]: Finished difference Result 250 states and 348 transitions. [2024-10-11 13:17:49,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:17:49,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 163 [2024-10-11 13:17:49,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:49,722 INFO L225 Difference]: With dead ends: 250 [2024-10-11 13:17:49,722 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 13:17:49,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:17:49,723 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 142 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:49,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 467 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 13:17:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 13:17:49,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2024-10-11 13:17:49,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:17:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 173 transitions. [2024-10-11 13:17:49,731 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 173 transitions. Word has length 163 [2024-10-11 13:17:49,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:49,731 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 173 transitions. [2024-10-11 13:17:49,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:17:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 173 transitions. [2024-10-11 13:17:49,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 13:17:49,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:49,733 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:49,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:49,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:49,934 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:49,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:49,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1033891128, now seen corresponding path program 1 times [2024-10-11 13:17:49,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:17:49,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125864022] [2024-10-11 13:17:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:49,935 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-11 13:17:49,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:17:49,936 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:49,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:50,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:17:50,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:50,327 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 95 treesize of output 41 [2024-10-11 13:17:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2024-10-11 13:17:50,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:17:50,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:17:50,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125864022] [2024-10-11 13:17:50,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125864022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:17:50,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:17:50,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:17:50,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092009777] [2024-10-11 13:17:50,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:17:50,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:17:50,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:17:50,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:17:50,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:17:50,348 INFO L87 Difference]: Start difference. First operand 125 states and 173 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:17:51,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:17:51,258 INFO L93 Difference]: Finished difference Result 250 states and 346 transitions. [2024-10-11 13:17:51,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:17:51,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 165 [2024-10-11 13:17:51,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:17:51,260 INFO L225 Difference]: With dead ends: 250 [2024-10-11 13:17:51,264 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 13:17:51,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:17:51,265 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 132 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:17:51,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 465 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:17:51,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 13:17:51,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2024-10-11 13:17:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 13:17:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 172 transitions. [2024-10-11 13:17:51,292 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 172 transitions. Word has length 165 [2024-10-11 13:17:51,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:17:51,294 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 172 transitions. [2024-10-11 13:17:51,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 13:17:51,295 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 172 transitions. [2024-10-11 13:17:51,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 13:17:51,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:17:51,296 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:17:51,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:51,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:51,498 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:17:51,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:17:51,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1545903154, now seen corresponding path program 1 times [2024-10-11 13:17:51,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:17:51,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178401951] [2024-10-11 13:17:51,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:51,500 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-11 13:17:51,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:17:51,503 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:51,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:17:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:51,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 13:17:51,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:51,974 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-11 13:17:52,119 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-11 13:17:52,181 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-11 13:17:52,253 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-11 13:17:52,308 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-11 13:17:52,758 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 113 treesize of output 65 [2024-10-11 13:17:52,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:17:52,839 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 194 treesize of output 80 [2024-10-11 13:17:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-10-11 13:17:52,885 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:17:52,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:17:52,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178401951] [2024-10-11 13:17:52,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178401951] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:17:52,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [230162261] [2024-10-11 13:17:52,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:17:52,995 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:17:52,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:17:52,997 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:17:52,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-10-11 13:17:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:17:54,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 13:17:54,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:17:54,826 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-11 13:17:55,195 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 64 treesize of output 32 [2024-10-11 13:17:55,365 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 64 treesize of output 32 [2024-10-11 13:17:55,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 64 treesize of output 32 [2024-10-11 13:17:55,696 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 64 treesize of output 32 [2024-10-11 13:17:56,726 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 103 treesize of output 59 [2024-10-11 13:17:56,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:17:56,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 80 [2024-10-11 13:17:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-10-11 13:17:56,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:17:56,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [230162261] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:17:56,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:17:56,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-10-11 13:17:56,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451841140] [2024-10-11 13:17:56,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:17:56,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 13:17:56,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:17:56,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 13:17:56,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:17:56,907 INFO L87 Difference]: Start difference. First operand 125 states and 172 transitions. Second operand has 16 states, 16 states have (on average 7.6875) internal successors, (123), 15 states have internal predecessors, (123), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-10-11 13:17:59,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:18:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:00,876 INFO L93 Difference]: Finished difference Result 368 states and 507 transitions. [2024-10-11 13:18:00,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:18:00,877 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.6875) internal successors, (123), 15 states have internal predecessors, (123), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 167 [2024-10-11 13:18:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:00,878 INFO L225 Difference]: With dead ends: 368 [2024-10-11 13:18:00,878 INFO L226 Difference]: Without dead ends: 244 [2024-10-11 13:18:00,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 358 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2024-10-11 13:18:00,879 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 422 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:00,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1034 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 13:18:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-11 13:18:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 202. [2024-10-11 13:18:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 158 states have (on average 1.2848101265822784) internal successors, (203), 158 states have internal predecessors, (203), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:18:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 283 transitions. [2024-10-11 13:18:00,892 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 283 transitions. Word has length 167 [2024-10-11 13:18:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:00,892 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 283 transitions. [2024-10-11 13:18:00,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.6875) internal successors, (123), 15 states have internal predecessors, (123), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-10-11 13:18:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 283 transitions. [2024-10-11 13:18:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 13:18:00,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:00,894 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:00,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:01,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-10-11 13:18:01,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 13:18:01,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:01,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:01,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1104267222, now seen corresponding path program 1 times [2024-10-11 13:18:01,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:01,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083610584] [2024-10-11 13:18:01,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:01,300 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-11 13:18:01,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:01,301 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:01,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:01,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 13:18:01,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:01,724 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 79 treesize of output 43 [2024-10-11 13:18:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 8 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-10-11 13:18:01,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:18:01,937 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 49 treesize of output 25 [2024-10-11 13:18:01,949 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-11 13:18:01,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:01,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083610584] [2024-10-11 13:18:01,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083610584] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:18:01,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:18:01,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-11 13:18:01,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805724226] [2024-10-11 13:18:01,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:18:01,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:18:01,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:01,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:18:01,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:18:01,952 INFO L87 Difference]: Start difference. First operand 202 states and 283 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2024-10-11 13:18:03,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:03,112 INFO L93 Difference]: Finished difference Result 418 states and 582 transitions. [2024-10-11 13:18:03,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 13:18:03,112 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) Word has length 169 [2024-10-11 13:18:03,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:03,115 INFO L225 Difference]: With dead ends: 418 [2024-10-11 13:18:03,115 INFO L226 Difference]: Without dead ends: 206 [2024-10-11 13:18:03,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:18:03,117 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 137 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:03,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 648 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 13:18:03,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-11 13:18:03,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 200. [2024-10-11 13:18:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 156 states have (on average 1.2756410256410255) internal successors, (199), 156 states have internal predecessors, (199), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:18:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 279 transitions. [2024-10-11 13:18:03,134 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 279 transitions. Word has length 169 [2024-10-11 13:18:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:03,134 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 279 transitions. [2024-10-11 13:18:03,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2024-10-11 13:18:03,135 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 279 transitions. [2024-10-11 13:18:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 13:18:03,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:03,136 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:03,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:03,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:03,338 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:03,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:03,339 INFO L85 PathProgramCache]: Analyzing trace with hash 701148627, now seen corresponding path program 1 times [2024-10-11 13:18:03,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:03,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602196040] [2024-10-11 13:18:03,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:03,339 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-11 13:18:03,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:03,341 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:03,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:03,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 13:18:03,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:03,795 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-11 13:18:03,912 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-11 13:18:03,985 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-11 13:18:04,038 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-11 13:18:04,082 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-11 13:18:04,497 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 113 treesize of output 65 [2024-10-11 13:18:04,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:18:04,580 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 194 treesize of output 80 [2024-10-11 13:18:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-10-11 13:18:04,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:18:04,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:04,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602196040] [2024-10-11 13:18:04,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602196040] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:18:04,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1660536839] [2024-10-11 13:18:04,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:04,750 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:18:04,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:18:04,752 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:18:04,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-10-11 13:18:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:06,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 13:18:06,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:06,608 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-11 13:18:06,871 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 64 treesize of output 32 [2024-10-11 13:18:06,944 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 64 treesize of output 32 [2024-10-11 13:18:07,020 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 64 treesize of output 32 [2024-10-11 13:18:07,080 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 64 treesize of output 32 [2024-10-11 13:18:07,694 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 103 treesize of output 59 [2024-10-11 13:18:07,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:18:07,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 80 [2024-10-11 13:18:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2024-10-11 13:18:07,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:18:07,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1660536839] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:18:07,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:18:07,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-10-11 13:18:07,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702717725] [2024-10-11 13:18:07,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:18:07,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 13:18:07,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:07,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 13:18:07,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:18:07,887 INFO L87 Difference]: Start difference. First operand 200 states and 279 transitions. Second operand has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 16 states have internal predecessors, (126), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-10-11 13:18:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:11,450 INFO L93 Difference]: Finished difference Result 439 states and 607 transitions. [2024-10-11 13:18:11,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:18:11,451 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 16 states have internal predecessors, (126), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 169 [2024-10-11 13:18:11,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:11,452 INFO L225 Difference]: With dead ends: 439 [2024-10-11 13:18:11,452 INFO L226 Difference]: Without dead ends: 240 [2024-10-11 13:18:11,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2024-10-11 13:18:11,453 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 525 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:11,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1072 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 13:18:11,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-11 13:18:11,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2024-10-11 13:18:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 158 states have (on average 1.2784810126582278) internal successors, (202), 158 states have internal predecessors, (202), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:18:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 282 transitions. [2024-10-11 13:18:11,466 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 282 transitions. Word has length 169 [2024-10-11 13:18:11,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:11,467 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 282 transitions. [2024-10-11 13:18:11,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.411764705882353) internal successors, (126), 16 states have internal predecessors, (126), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-10-11 13:18:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 282 transitions. [2024-10-11 13:18:11,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 13:18:11,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:11,468 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:11,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-10-11 13:18:11,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-11 13:18:11,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:11,870 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:11,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:11,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2085186461, now seen corresponding path program 1 times [2024-10-11 13:18:11,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:11,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030843652] [2024-10-11 13:18:11,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:11,871 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-11 13:18:11,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:11,872 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:11,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:12,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:18:12,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:18:12,215 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:18:12,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:12,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030843652] [2024-10-11 13:18:12,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030843652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:12,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:12,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:18:12,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661881224] [2024-10-11 13:18:12,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:12,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:18:12,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:12,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:18:12,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:18:12,217 INFO L87 Difference]: Start difference. First operand 202 states and 282 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:18:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:12,329 INFO L93 Difference]: Finished difference Result 406 states and 567 transitions. [2024-10-11 13:18:12,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:18:12,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 169 [2024-10-11 13:18:12,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:12,334 INFO L225 Difference]: With dead ends: 406 [2024-10-11 13:18:12,335 INFO L226 Difference]: Without dead ends: 205 [2024-10-11 13:18:12,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 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-11 13:18:12,336 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:12,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:18:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-11 13:18:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-10-11 13:18:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 161 states have (on average 1.2732919254658386) internal successors, (205), 161 states have internal predecessors, (205), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:18:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 285 transitions. [2024-10-11 13:18:12,355 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 285 transitions. Word has length 169 [2024-10-11 13:18:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:12,356 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 285 transitions. [2024-10-11 13:18:12,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:18:12,356 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 285 transitions. [2024-10-11 13:18:12,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 13:18:12,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:12,359 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:12,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:12,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:12,560 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:12,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:12,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1421228460, now seen corresponding path program 1 times [2024-10-11 13:18:12,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:12,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260430809] [2024-10-11 13:18:12,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:12,561 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-11 13:18:12,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:12,563 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:12,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:13,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 13:18:13,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:13,066 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-11 13:18:13,244 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 66 treesize of output 30 [2024-10-11 13:18:13,297 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 66 treesize of output 30 [2024-10-11 13:18:13,367 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 66 treesize of output 30 [2024-10-11 13:18:13,413 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 66 treesize of output 30 [2024-10-11 13:18:13,900 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 111 treesize of output 63 [2024-10-11 13:18:13,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:18:13,979 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 192 treesize of output 78 [2024-10-11 13:18:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-10-11 13:18:14,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:18:14,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:14,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260430809] [2024-10-11 13:18:14,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260430809] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:18:14,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1431691987] [2024-10-11 13:18:14,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:14,147 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:18:14,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:18:14,149 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:18:14,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-10-11 13:18:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:16,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 13:18:16,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:16,251 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-11 13:18:16,729 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 62 treesize of output 30 [2024-10-11 13:18:16,831 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 62 treesize of output 30 [2024-10-11 13:18:16,925 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 62 treesize of output 30 [2024-10-11 13:18:17,004 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 62 treesize of output 30 [2024-10-11 13:18:17,802 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 101 treesize of output 57 [2024-10-11 13:18:17,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:18:17,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 78 [2024-10-11 13:18:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-10-11 13:18:17,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:18:18,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1431691987] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:18:18,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:18:18,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-10-11 13:18:18,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076511461] [2024-10-11 13:18:18,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:18:18,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 13:18:18,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:18,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 13:18:18,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2024-10-11 13:18:18,023 INFO L87 Difference]: Start difference. First operand 205 states and 285 transitions. Second operand has 22 states, 20 states have (on average 6.65) internal successors, (133), 19 states have internal predecessors, (133), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2024-10-11 13:18:20,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:18:23,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:23,178 INFO L93 Difference]: Finished difference Result 469 states and 638 transitions. [2024-10-11 13:18:23,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 13:18:23,179 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 6.65) internal successors, (133), 19 states have internal predecessors, (133), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) Word has length 169 [2024-10-11 13:18:23,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:23,180 INFO L225 Difference]: With dead ends: 469 [2024-10-11 13:18:23,180 INFO L226 Difference]: Without dead ends: 265 [2024-10-11 13:18:23,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 355 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=327, Invalid=1313, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 13:18:23,182 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 382 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:23,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1096 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-11 13:18:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-11 13:18:23,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 209. [2024-10-11 13:18:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 164 states have (on average 1.2682926829268293) internal successors, (208), 164 states have internal predecessors, (208), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:18:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 288 transitions. [2024-10-11 13:18:23,198 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 288 transitions. Word has length 169 [2024-10-11 13:18:23,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:23,199 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 288 transitions. [2024-10-11 13:18:23,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 6.65) internal successors, (133), 19 states have internal predecessors, (133), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2024-10-11 13:18:23,200 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 288 transitions. [2024-10-11 13:18:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 13:18:23,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:23,201 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:23,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-10-11 13:18:23,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-11 13:18:23,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:23,606 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:23,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash -590840400, now seen corresponding path program 1 times [2024-10-11 13:18:23,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:23,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526096807] [2024-10-11 13:18:23,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:23,607 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-11 13:18:23,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:23,608 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:23,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:24,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:18:24,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:24,154 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-11 13:18:24,207 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-11 13:18:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:18:24,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:18:24,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:24,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526096807] [2024-10-11 13:18:24,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526096807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:24,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:24,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:18:24,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122732696] [2024-10-11 13:18:24,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:24,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:18:24,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:24,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:18:24,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:18:24,223 INFO L87 Difference]: Start difference. First operand 209 states and 288 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:18:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:24,445 INFO L93 Difference]: Finished difference Result 361 states and 501 transitions. [2024-10-11 13:18:24,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:18:24,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 171 [2024-10-11 13:18:24,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:24,448 INFO L225 Difference]: With dead ends: 361 [2024-10-11 13:18:24,448 INFO L226 Difference]: Without dead ends: 359 [2024-10-11 13:18:24,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 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-11 13:18:24,449 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 127 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:24,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 775 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:18:24,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-11 13:18:24,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 211. [2024-10-11 13:18:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 166 states have (on average 1.2650602409638554) internal successors, (210), 166 states have internal predecessors, (210), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:18:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 290 transitions. [2024-10-11 13:18:24,470 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 290 transitions. Word has length 171 [2024-10-11 13:18:24,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:24,471 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 290 transitions. [2024-10-11 13:18:24,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:18:24,471 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 290 transitions. [2024-10-11 13:18:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 13:18:24,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:24,472 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:24,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:24,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:24,677 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:24,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:24,678 INFO L85 PathProgramCache]: Analyzing trace with hash -590780818, now seen corresponding path program 1 times [2024-10-11 13:18:24,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:24,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816589193] [2024-10-11 13:18:24,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:24,678 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-11 13:18:24,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:24,679 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:24,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:25,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 13:18:25,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:25,254 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-11 13:18:25,258 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 19 treesize of output 1 [2024-10-11 13:18:25,260 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 19 treesize of output 1 [2024-10-11 13:18:25,262 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 19 treesize of output 1 [2024-10-11 13:18:25,265 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 39 treesize of output 23 [2024-10-11 13:18:25,266 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 19 treesize of output 15 [2024-10-11 13:18:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:18:25,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:18:25,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:25,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816589193] [2024-10-11 13:18:25,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816589193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:25,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:25,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:18:25,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545359242] [2024-10-11 13:18:25,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:25,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:18:25,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:25,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:18:25,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:18:25,356 INFO L87 Difference]: Start difference. First operand 211 states and 290 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:18:25,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:25,572 INFO L93 Difference]: Finished difference Result 531 states and 730 transitions. [2024-10-11 13:18:25,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:18:25,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 171 [2024-10-11 13:18:25,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:25,575 INFO L225 Difference]: With dead ends: 531 [2024-10-11 13:18:25,575 INFO L226 Difference]: Without dead ends: 321 [2024-10-11 13:18:25,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 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-11 13:18:25,576 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 104 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:25,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 714 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:18:25,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-11 13:18:25,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2024-10-11 13:18:25,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 246 states have (on average 1.2601626016260163) internal successors, (310), 248 states have internal predecessors, (310), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 13:18:25,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 438 transitions. [2024-10-11 13:18:25,599 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 438 transitions. Word has length 171 [2024-10-11 13:18:25,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:25,599 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 438 transitions. [2024-10-11 13:18:25,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:18:25,599 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 438 transitions. [2024-10-11 13:18:25,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 13:18:25,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:25,600 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:25,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 13:18:25,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:25,802 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:25,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:25,802 INFO L85 PathProgramCache]: Analyzing trace with hash -533522516, now seen corresponding path program 1 times [2024-10-11 13:18:25,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:25,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289111425] [2024-10-11 13:18:25,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:25,803 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-11 13:18:25,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:25,806 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:25,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:26,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 13:18:26,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:26,430 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-11 13:18:26,434 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-11 13:18:26,485 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-11 13:18:26,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:18:26,601 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 59 treesize of output 49 [2024-10-11 13:18:26,604 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 19 treesize of output 15 [2024-10-11 13:18:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-10-11 13:18:26,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:18:26,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:26,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289111425] [2024-10-11 13:18:26,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289111425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:26,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:26,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:18:26,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199852181] [2024-10-11 13:18:26,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:26,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:18:26,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:26,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:18:26,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:18:26,816 INFO L87 Difference]: Start difference. First operand 319 states and 438 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 13:18:27,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:27,443 INFO L93 Difference]: Finished difference Result 555 states and 752 transitions. [2024-10-11 13:18:27,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:18:27,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 171 [2024-10-11 13:18:27,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:27,449 INFO L225 Difference]: With dead ends: 555 [2024-10-11 13:18:27,449 INFO L226 Difference]: Without dead ends: 337 [2024-10-11 13:18:27,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:18:27,450 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 283 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:27,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 638 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:18:27,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-11 13:18:27,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2024-10-11 13:18:27,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 256 states have (on average 1.24609375) internal successors, (319), 258 states have internal predecessors, (319), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 13:18:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 455 transitions. [2024-10-11 13:18:27,495 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 455 transitions. Word has length 171 [2024-10-11 13:18:27,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:27,496 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 455 transitions. [2024-10-11 13:18:27,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-11 13:18:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 455 transitions. [2024-10-11 13:18:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 13:18:27,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:27,498 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:27,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 13:18:27,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:27,699 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:27,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:27,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1342869142, now seen corresponding path program 1 times [2024-10-11 13:18:27,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:27,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345660900] [2024-10-11 13:18:27,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:27,700 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-11 13:18:27,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:27,703 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:27,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:28,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:18:28,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:28,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 14 treesize of output 10 [2024-10-11 13:18:29,174 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 28 [2024-10-11 13:18:29,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:18:29,297 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 81 treesize of output 39 [2024-10-11 13:18:29,346 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 98 proven. 57 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-10-11 13:18:29,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:18:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:18:29,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:29,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345660900] [2024-10-11 13:18:29,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345660900] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 13:18:29,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 13:18:29,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2024-10-11 13:18:29,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842087631] [2024-10-11 13:18:29,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:29,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:18:29,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:29,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:18:29,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:18:29,476 INFO L87 Difference]: Start difference. First operand 335 states and 455 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:18:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:29,701 INFO L93 Difference]: Finished difference Result 617 states and 823 transitions. [2024-10-11 13:18:29,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:18:29,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 171 [2024-10-11 13:18:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:29,705 INFO L225 Difference]: With dead ends: 617 [2024-10-11 13:18:29,705 INFO L226 Difference]: Without dead ends: 391 [2024-10-11 13:18:29,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:18:29,707 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 36 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:29,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 737 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:18:29,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-11 13:18:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 368. [2024-10-11 13:18:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 289 states have (on average 1.2560553633217992) internal successors, (363), 291 states have internal predecessors, (363), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 13:18:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 499 transitions. [2024-10-11 13:18:29,737 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 499 transitions. Word has length 171 [2024-10-11 13:18:29,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:29,737 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 499 transitions. [2024-10-11 13:18:29,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:18:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 499 transitions. [2024-10-11 13:18:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 13:18:29,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:29,739 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:29,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:29,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:29,943 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:29,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:29,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2043933720, now seen corresponding path program 1 times [2024-10-11 13:18:29,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:29,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928934987] [2024-10-11 13:18:29,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:29,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-11 13:18:29,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:29,946 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:29,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:30,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:18:30,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:30,294 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 19 treesize of output 13 [2024-10-11 13:18:30,300 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 13 treesize of output 9 [2024-10-11 13:18:30,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:18:30,480 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 66 treesize of output 34 [2024-10-11 13:18:30,484 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 38 treesize of output 26 [2024-10-11 13:18:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 13:18:30,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:18:30,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:30,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928934987] [2024-10-11 13:18:30,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928934987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:18:30,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:18:30,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:18:30,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618283126] [2024-10-11 13:18:30,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:18:30,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:18:30,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:18:30,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:18:30,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:18:30,722 INFO L87 Difference]: Start difference. First operand 368 states and 499 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:18:35,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:18:38,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:18:38,056 INFO L93 Difference]: Finished difference Result 598 states and 799 transitions. [2024-10-11 13:18:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:18:38,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 171 [2024-10-11 13:18:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:18:38,062 INFO L225 Difference]: With dead ends: 598 [2024-10-11 13:18:38,062 INFO L226 Difference]: Without dead ends: 339 [2024-10-11 13:18:38,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:18:38,066 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 93 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:18:38,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 642 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-10-11 13:18:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-11 13:18:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2024-10-11 13:18:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 258 states have (on average 1.2286821705426356) internal successors, (317), 260 states have internal predecessors, (317), 68 states have call successors, (68), 12 states have call predecessors, (68), 12 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 13:18:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 453 transitions. [2024-10-11 13:18:38,130 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 453 transitions. Word has length 171 [2024-10-11 13:18:38,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:18:38,134 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 453 transitions. [2024-10-11 13:18:38,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 13:18:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 453 transitions. [2024-10-11 13:18:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 13:18:38,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:18:38,136 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:18:38,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 13:18:38,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:38,336 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:18:38,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:18:38,336 INFO L85 PathProgramCache]: Analyzing trace with hash 254445273, now seen corresponding path program 1 times [2024-10-11 13:18:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:18:38,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054820695] [2024-10-11 13:18:38,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:38,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-11 13:18:38,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:18:38,342 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:38,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 13:18:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:38,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 13:18:38,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:18:39,363 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-11 13:18:42,556 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 66 treesize of output 30 [2024-10-11 13:18:43,421 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 66 treesize of output 30 [2024-10-11 13:18:44,296 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 66 treesize of output 30 [2024-10-11 13:18:45,017 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 66 treesize of output 30 [2024-10-11 13:18:52,680 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 111 treesize of output 63 [2024-10-11 13:18:54,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:18:54,082 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 192 treesize of output 78 [2024-10-11 13:18:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 18 proven. 206 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-10-11 13:18:55,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:18:57,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:18:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054820695] [2024-10-11 13:18:57,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054820695] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:18:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [933844035] [2024-10-11 13:18:57,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:18:57,641 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:18:57,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:18:57,643 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:18:57,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-10-11 13:18:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:18:59,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 13:18:59,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:19:05,692 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