./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 526662cda712a72aaa9b0b3d772735b85caa85c8f8cefc4189404860ae784fc7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:09:43,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:09:43,945 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:09:43,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:09:43,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:09:43,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:09:43,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:09:43,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:09:43,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:09:43,978 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:09:43,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:09:43,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:09:43,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:09:43,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:09:43,978 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:09:43,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:09:43,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:09:43,979 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:09:43,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:09:43,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:09:43,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:09:43,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:09:43,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:09:43,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:09:43,979 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:09:43,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:09:43,979 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:09:43,979 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:09:43,979 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:09:43,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:09:43,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:09:43,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:09:43,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:09:43,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:09:43,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:09:43,980 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:09:43,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:09:43,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:09:43,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:09:43,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:09:43,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:09:43,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:09:43,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:09:43,981 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 526662cda712a72aaa9b0b3d772735b85caa85c8f8cefc4189404860ae784fc7 [2025-03-04 01:09:44,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:09:44,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:09:44,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:09:44,226 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:09:44,227 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:09:44,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i [2025-03-04 01:09:45,375 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b07809e7b/012051c53d38478d9e74ae7d80a9c3ca/FLAGdff41da74 [2025-03-04 01:09:45,611 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:09:45,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i [2025-03-04 01:09:45,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b07809e7b/012051c53d38478d9e74ae7d80a9c3ca/FLAGdff41da74 [2025-03-04 01:09:45,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b07809e7b/012051c53d38478d9e74ae7d80a9c3ca [2025-03-04 01:09:45,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:09:45,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:09:45,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:09:45,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:09:45,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:09:45,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:09:45" (1/1) ... [2025-03-04 01:09:45,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55bee783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:45, skipping insertion in model container [2025-03-04 01:09:45,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:09:45" (1/1) ... [2025-03-04 01:09:45,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:09:46,047 WARN L250 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-73.i[916,929] [2025-03-04 01:09:46,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:09:46,089 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:09:46,096 WARN L250 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-73.i[916,929] [2025-03-04 01:09:46,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:09:46,130 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:09:46,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:46 WrapperNode [2025-03-04 01:09:46,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:09:46,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:09:46,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:09:46,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:09:46,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:46" (1/1) ... [2025-03-04 01:09:46,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:46" (1/1) ... [2025-03-04 01:09:46,164 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 497 [2025-03-04 01:09:46,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:09:46,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:09:46,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:09:46,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:09:46,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:46" (1/1) ... [2025-03-04 01:09:46,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:46" (1/1) ... [2025-03-04 01:09:46,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:46" (1/1) ... [2025-03-04 01:09:46,195 INFO L175 MemorySlicer]: Split 134 memory accesses to 7 slices as follows [2, 22, 17, 32, 9, 9, 43]. 32 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 2, 3, 2, 1, 3]. The 19 writes are split as follows [0, 3, 3, 6, 2, 1, 4]. [2025-03-04 01:09:46,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:46" (1/1) ... [2025-03-04 01:09:46,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:46" (1/1) ... [2025-03-04 01:09:46,210 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:46" (1/1) ... [2025-03-04 01:09:46,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:46" (1/1) ... [2025-03-04 01:09:46,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:46" (1/1) ... [2025-03-04 01:09:46,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:46" (1/1) ... [2025-03-04 01:09:46,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:09:46,218 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:09:46,218 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:09:46,218 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:09:46,219 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:46" (1/1) ... [2025-03-04 01:09:46,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:09:46,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:09:46,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:09:46,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:09:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:09:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:09:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:09:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:09:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:09:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:09:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:09:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 01:09:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:09:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:09:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:09:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:09:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:09:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:09:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:09:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:09:46,265 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:09:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:09:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:09:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:09:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:09:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:09:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:09:46,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:09:46,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:09:46,384 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:09:46,385 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:09:46,766 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L105: havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem98#1;havoc property_#t~ite113#1;havoc property_#t~mem104#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite132#1;havoc property_#t~mem117#1;havoc property_#t~ite129#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~ite128#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2025-03-04 01:09:46,802 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2025-03-04 01:09:46,802 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:09:46,809 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:09:46,811 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:09:46,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:09:46 BoogieIcfgContainer [2025-03-04 01:09:46,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:09:46,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:09:46,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:09:46,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:09:46,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:09:45" (1/3) ... [2025-03-04 01:09:46,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a20da3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:09:46, skipping insertion in model container [2025-03-04 01:09:46,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:46" (2/3) ... [2025-03-04 01:09:46,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a20da3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:09:46, skipping insertion in model container [2025-03-04 01:09:46,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:09:46" (3/3) ... [2025-03-04 01:09:46,818 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-73.i [2025-03-04 01:09:46,828 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:09:46,830 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-73.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:09:46,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:09:46,881 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;@4f191686, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:09:46,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:09:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 92 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:09:46,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:09:46,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:46,896 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:46,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:46,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:46,900 INFO L85 PathProgramCache]: Analyzing trace with hash -655888968, now seen corresponding path program 1 times [2025-03-04 01:09:46,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:46,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503260483] [2025-03-04 01:09:46,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:46,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:46,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:09:47,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:09:47,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:47,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 01:09:47,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:47,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503260483] [2025-03-04 01:09:47,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503260483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:09:47,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406386726] [2025-03-04 01:09:47,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:47,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:09:47,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:09:47,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:09:47,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:09:47,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:09:47,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:09:47,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:47,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:47,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:09:47,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:09:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 01:09:47,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:09:47,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406386726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:47,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:09:47,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:09:47,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136725939] [2025-03-04 01:09:47,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:47,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:09:47,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:47,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:09:47,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:09:47,411 INFO L87 Difference]: Start difference. First operand has 109 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 92 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:09:47,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:47,431 INFO L93 Difference]: Finished difference Result 212 states and 330 transitions. [2025-03-04 01:09:47,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:09:47,432 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2025-03-04 01:09:47,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:47,436 INFO L225 Difference]: With dead ends: 212 [2025-03-04 01:09:47,436 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 01:09:47,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:09:47,441 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:47,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:47,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 01:09:47,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-04 01:09:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:09:47,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2025-03-04 01:09:47,473 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2025-03-04 01:09:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:47,474 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2025-03-04 01:09:47,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:09:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2025-03-04 01:09:47,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:09:47,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:47,477 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:47,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:09:47,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:09:47,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:47,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:47,682 INFO L85 PathProgramCache]: Analyzing trace with hash 33216473, now seen corresponding path program 1 times [2025-03-04 01:09:47,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:47,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629117691] [2025-03-04 01:09:47,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:47,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:47,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:09:47,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:09:47,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:47,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:09:48,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:48,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629117691] [2025-03-04 01:09:48,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629117691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:09:48,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96852684] [2025-03-04 01:09:48,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:48,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:09:48,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:09:48,065 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:09:48,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:09:48,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:09:48,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:09:48,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:48,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:48,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:09:48,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:09:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:09:48,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:09:48,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96852684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:48,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:09:48,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:09:48,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102507551] [2025-03-04 01:09:48,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:48,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:09:48,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:48,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:09:48,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:48,282 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:48,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:48,309 INFO L93 Difference]: Finished difference Result 212 states and 311 transitions. [2025-03-04 01:09:48,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:09:48,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-04 01:09:48,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:48,311 INFO L225 Difference]: With dead ends: 212 [2025-03-04 01:09:48,311 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 01:09:48,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:48,312 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:48,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:48,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 01:09:48,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-03-04 01:09:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:09:48,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2025-03-04 01:09:48,322 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 129 [2025-03-04 01:09:48,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:48,323 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2025-03-04 01:09:48,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:48,323 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2025-03-04 01:09:48,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:09:48,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:48,324 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:48,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:09:48,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 01:09:48,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:48,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:48,525 INFO L85 PathProgramCache]: Analyzing trace with hash 920720154, now seen corresponding path program 1 times [2025-03-04 01:09:48,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:48,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941641128] [2025-03-04 01:09:48,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:48,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:48,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:09:48,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:09:48,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:48,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:09:48,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:48,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941641128] [2025-03-04 01:09:48,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941641128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:09:48,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164974058] [2025-03-04 01:09:48,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:48,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:09:48,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:09:48,732 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:09:48,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:09:48,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:09:48,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:09:48,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:48,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:48,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:09:48,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:09:48,939 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:09:48,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:09:48,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164974058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:48,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:09:48,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:09:48,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319771882] [2025-03-04 01:09:48,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:48,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:09:48,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:48,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:09:48,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:48,944 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:48,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:48,972 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2025-03-04 01:09:48,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:09:48,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-04 01:09:48,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:48,975 INFO L225 Difference]: With dead ends: 216 [2025-03-04 01:09:48,977 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 01:09:48,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:48,978 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:48,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:48,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 01:09:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-03-04 01:09:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:09:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2025-03-04 01:09:48,988 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 129 [2025-03-04 01:09:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:48,988 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2025-03-04 01:09:48,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:48,988 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2025-03-04 01:09:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:09:48,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:48,992 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:48,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:09:49,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:09:49,193 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:49,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:49,193 INFO L85 PathProgramCache]: Analyzing trace with hash 921643675, now seen corresponding path program 1 times [2025-03-04 01:09:49,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:49,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614785298] [2025-03-04 01:09:49,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:49,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:49,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:09:49,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:09:49,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:49,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:09:49,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:49,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614785298] [2025-03-04 01:09:49,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614785298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:09:49,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998900072] [2025-03-04 01:09:49,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:49,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:09:49,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:09:49,366 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:09:49,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:09:49,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:09:49,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:09:49,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:49,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:49,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:09:49,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:09:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:09:49,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:09:49,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998900072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:49,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:09:49,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:09:49,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485747441] [2025-03-04 01:09:49,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:49,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:09:49,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:49,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:09:49,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:49,553 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:49,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:49,577 INFO L93 Difference]: Finished difference Result 219 states and 318 transitions. [2025-03-04 01:09:49,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:09:49,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-04 01:09:49,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:49,579 INFO L225 Difference]: With dead ends: 219 [2025-03-04 01:09:49,580 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 01:09:49,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:49,581 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:49,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:49,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 01:09:49,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-04 01:09:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:09:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2025-03-04 01:09:49,593 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 129 [2025-03-04 01:09:49,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:49,594 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2025-03-04 01:09:49,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:49,594 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2025-03-04 01:09:49,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:09:49,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:49,598 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:49,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:09:49,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:09:49,799 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:49,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:49,799 INFO L85 PathProgramCache]: Analyzing trace with hash -16507975, now seen corresponding path program 1 times [2025-03-04 01:09:49,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:49,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335543472] [2025-03-04 01:09:49,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:49,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:49,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:09:49,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:09:49,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:49,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:09:50,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:50,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335543472] [2025-03-04 01:09:50,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335543472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:50,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:50,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:09:50,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28951769] [2025-03-04 01:09:50,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:50,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:09:50,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:50,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:09:50,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:09:50,256 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:50,435 INFO L93 Difference]: Finished difference Result 332 states and 480 transitions. [2025-03-04 01:09:50,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:09:50,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-04 01:09:50,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:50,437 INFO L225 Difference]: With dead ends: 332 [2025-03-04 01:09:50,438 INFO L226 Difference]: Without dead ends: 223 [2025-03-04 01:09:50,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:09:50,439 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 103 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:50,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 437 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:09:50,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-04 01:09:50,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 217. [2025-03-04 01:09:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 184 states have internal predecessors, (254), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:09:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 314 transitions. [2025-03-04 01:09:50,462 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 314 transitions. Word has length 131 [2025-03-04 01:09:50,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:50,464 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 314 transitions. [2025-03-04 01:09:50,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:50,464 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 314 transitions. [2025-03-04 01:09:50,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:09:50,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:50,465 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:50,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:09:50,465 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:50,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:50,466 INFO L85 PathProgramCache]: Analyzing trace with hash 194842938, now seen corresponding path program 1 times [2025-03-04 01:09:50,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:50,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189650606] [2025-03-04 01:09:50,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:50,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:50,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:09:50,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:09:50,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:50,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:09:50,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:50,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189650606] [2025-03-04 01:09:50,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189650606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:50,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:50,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:09:50,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794325889] [2025-03-04 01:09:50,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:50,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:09:50,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:50,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:09:50,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:50,984 INFO L87 Difference]: Start difference. First operand 217 states and 314 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:51,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:51,345 INFO L93 Difference]: Finished difference Result 496 states and 718 transitions. [2025-03-04 01:09:51,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:09:51,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-04 01:09:51,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:51,347 INFO L225 Difference]: With dead ends: 496 [2025-03-04 01:09:51,348 INFO L226 Difference]: Without dead ends: 282 [2025-03-04 01:09:51,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:09:51,349 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 183 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:51,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 865 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:09:51,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-04 01:09:51,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 215. [2025-03-04 01:09:51,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 182 states have (on average 1.379120879120879) internal successors, (251), 182 states have internal predecessors, (251), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:09:51,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 311 transitions. [2025-03-04 01:09:51,369 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 311 transitions. Word has length 131 [2025-03-04 01:09:51,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:51,371 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 311 transitions. [2025-03-04 01:09:51,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 311 transitions. [2025-03-04 01:09:51,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:09:51,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:51,372 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:51,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:09:51,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:51,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:51,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1329135467, now seen corresponding path program 1 times [2025-03-04 01:09:51,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:51,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925440388] [2025-03-04 01:09:51,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:51,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:51,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:09:51,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:09:51,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:51,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:09:51,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:51,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925440388] [2025-03-04 01:09:51,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925440388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:51,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:51,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:09:51,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634724807] [2025-03-04 01:09:51,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:51,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:09:51,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:51,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:09:51,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:09:51,689 INFO L87 Difference]: Start difference. First operand 215 states and 311 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:51,909 INFO L93 Difference]: Finished difference Result 437 states and 632 transitions. [2025-03-04 01:09:51,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:09:51,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-03-04 01:09:51,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:51,911 INFO L225 Difference]: With dead ends: 437 [2025-03-04 01:09:51,911 INFO L226 Difference]: Without dead ends: 328 [2025-03-04 01:09:51,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:09:51,912 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 149 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:51,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 562 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:09:51,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-04 01:09:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 320. [2025-03-04 01:09:51,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 271 states have (on average 1.3800738007380073) internal successors, (374), 271 states have internal predecessors, (374), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 01:09:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 464 transitions. [2025-03-04 01:09:51,935 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 464 transitions. Word has length 132 [2025-03-04 01:09:51,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:51,935 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 464 transitions. [2025-03-04 01:09:51,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:51,935 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 464 transitions. [2025-03-04 01:09:51,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:09:51,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:51,936 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:51,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:09:51,936 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:51,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:51,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1117784554, now seen corresponding path program 1 times [2025-03-04 01:09:51,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:51,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149949440] [2025-03-04 01:09:51,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:51,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:51,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:09:51,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:09:51,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:51,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:09:52,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:52,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149949440] [2025-03-04 01:09:52,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149949440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:52,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:52,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:09:52,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963474248] [2025-03-04 01:09:52,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:52,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:09:52,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:52,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:09:52,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:52,390 INFO L87 Difference]: Start difference. First operand 320 states and 464 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:52,797 INFO L93 Difference]: Finished difference Result 600 states and 869 transitions. [2025-03-04 01:09:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:09:52,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-03-04 01:09:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:52,800 INFO L225 Difference]: With dead ends: 600 [2025-03-04 01:09:52,800 INFO L226 Difference]: Without dead ends: 386 [2025-03-04 01:09:52,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:09:52,801 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 288 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:52,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 960 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:09:52,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-04 01:09:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 215. [2025-03-04 01:09:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 182 states have (on average 1.379120879120879) internal successors, (251), 182 states have internal predecessors, (251), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:09:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 311 transitions. [2025-03-04 01:09:52,812 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 311 transitions. Word has length 132 [2025-03-04 01:09:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:52,813 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 311 transitions. [2025-03-04 01:09:52,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 311 transitions. [2025-03-04 01:09:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:09:52,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:52,814 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:52,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:09:52,814 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:52,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:52,815 INFO L85 PathProgramCache]: Analyzing trace with hash -266373843, now seen corresponding path program 1 times [2025-03-04 01:09:52,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:52,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096368008] [2025-03-04 01:09:52,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:52,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:52,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:09:52,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:09:52,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:52,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:09:53,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:53,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096368008] [2025-03-04 01:09:53,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096368008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:53,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:53,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:09:53,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390788080] [2025-03-04 01:09:53,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:53,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:09:53,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:53,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:09:53,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:09:53,148 INFO L87 Difference]: Start difference. First operand 215 states and 311 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:53,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:53,386 INFO L93 Difference]: Finished difference Result 595 states and 862 transitions. [2025-03-04 01:09:53,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:09:53,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-03-04 01:09:53,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:53,388 INFO L225 Difference]: With dead ends: 595 [2025-03-04 01:09:53,389 INFO L226 Difference]: Without dead ends: 383 [2025-03-04 01:09:53,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:53,389 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 183 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:53,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 644 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:09:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-04 01:09:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 318. [2025-03-04 01:09:53,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 269 states have (on average 1.3754646840148699) internal successors, (370), 269 states have internal predecessors, (370), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 01:09:53,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 460 transitions. [2025-03-04 01:09:53,411 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 460 transitions. Word has length 132 [2025-03-04 01:09:53,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:53,411 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 460 transitions. [2025-03-04 01:09:53,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 460 transitions. [2025-03-04 01:09:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:09:53,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:53,414 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:53,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:09:53,414 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:53,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:53,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1990537164, now seen corresponding path program 1 times [2025-03-04 01:09:53,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:53,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82603261] [2025-03-04 01:09:53,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:53,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:53,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:09:53,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:09:53,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:53,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:09:53,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:53,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82603261] [2025-03-04 01:09:53,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82603261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:53,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:53,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:09:53,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550723335] [2025-03-04 01:09:53,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:53,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:09:53,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:53,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:09:53,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:09:53,728 INFO L87 Difference]: Start difference. First operand 318 states and 460 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:53,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:53,996 INFO L93 Difference]: Finished difference Result 698 states and 1010 transitions. [2025-03-04 01:09:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:09:53,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-03-04 01:09:53,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:53,998 INFO L225 Difference]: With dead ends: 698 [2025-03-04 01:09:53,998 INFO L226 Difference]: Without dead ends: 383 [2025-03-04 01:09:53,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:54,000 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 176 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:54,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 644 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:09:54,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-04 01:09:54,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 318. [2025-03-04 01:09:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 269 states have (on average 1.3717472118959109) internal successors, (369), 269 states have internal predecessors, (369), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 01:09:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 459 transitions. [2025-03-04 01:09:54,028 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 459 transitions. Word has length 132 [2025-03-04 01:09:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:54,028 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 459 transitions. [2025-03-04 01:09:54,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:09:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 459 transitions. [2025-03-04 01:09:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:09:54,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:54,030 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:54,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:09:54,030 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:54,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:54,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1480002987, now seen corresponding path program 1 times [2025-03-04 01:09:54,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:54,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407857279] [2025-03-04 01:09:54,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:54,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:54,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:09:54,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:09:54,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:54,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:09:54,099 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:09:54,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:09:54,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:09:54,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:54,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:09:54,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:09:54,200 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:09:54,200 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:09:54,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:09:54,203 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:54,279 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:09:54,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:09:54 BoogieIcfgContainer [2025-03-04 01:09:54,284 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:09:54,285 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:09:54,285 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:09:54,285 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:09:54,285 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:09:46" (3/4) ... [2025-03-04 01:09:54,287 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:09:54,287 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:09:54,288 INFO L158 Benchmark]: Toolchain (without parser) took 8343.60ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 131.8MB in the beginning and 191.9MB in the end (delta: -60.1MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. [2025-03-04 01:09:54,288 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:09:54,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.72ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 116.9MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:09:54,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.67ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 113.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:09:54,289 INFO L158 Benchmark]: Boogie Preprocessor took 52.11ms. Allocated memory is still 167.8MB. Free memory was 113.3MB in the beginning and 108.5MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:09:54,289 INFO L158 Benchmark]: IcfgBuilder took 593.36ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 74.5MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:09:54,289 INFO L158 Benchmark]: TraceAbstraction took 7471.95ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 74.1MB in the beginning and 191.9MB in the end (delta: -117.9MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2025-03-04 01:09:54,290 INFO L158 Benchmark]: Witness Printer took 2.29ms. Allocated memory is still 293.6MB. Free memory is still 191.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:09:54,292 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.19ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.72ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 116.9MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.67ms. Allocated memory is still 167.8MB. Free memory was 116.9MB in the beginning and 113.3MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.11ms. Allocated memory is still 167.8MB. Free memory was 113.3MB in the beginning and 108.5MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 593.36ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 74.5MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7471.95ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 74.1MB in the beginning and 191.9MB in the end (delta: -117.9MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Witness Printer took 2.29ms. Allocated memory is still 293.6MB. Free memory is still 191.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someUnaryDOUBLEoperation at line 26, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 1 }; [L25-L27] double double_Array_0[2] = { -0.41, 5.5 }; [L25-L27] double double_Array_0[2] = { -0.41, 5.5 }; [L25-L27] double double_Array_0[2] = { -0.41, 5.5 }; [L28-L30] float float_Array_0[3] = { 15.75, 1.6, 16.5 }; [L28-L30] float float_Array_0[3] = { 15.75, 1.6, 16.5 }; [L28-L30] float float_Array_0[3] = { 15.75, 1.6, 16.5 }; [L28-L30] float float_Array_0[3] = { 15.75, 1.6, 16.5 }; [L31-L33] signed char signed_char_Array_0[2] = { 10, -10 }; [L31-L33] signed char signed_char_Array_0[2] = { 10, -10 }; [L31-L33] signed char signed_char_Array_0[2] = { 10, -10 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -16 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -16 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 100, 25, 1 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 100, 25, 1 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 100, 25, 1 }; [L37-L39] unsigned char unsigned_char_Array_0[3] = { 100, 25, 1 }; [L40] float last_1_float_Array_0_0_ = 15.75; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] CALL updateLastVariables() [L102] EXPR float_Array_0[0] [L102] last_1_float_Array_0_0_ = float_Array_0[0] [L112] RET updateLastVariables() [L113] CALL updateVariables() [L76] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L78] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L79] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L81] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L83] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L83] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L83] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L85] double_Array_0[0] = __VERIFIER_nondet_double() [L86] EXPR double_Array_0[0] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L86] EXPR double_Array_0[0] [L86] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L87] float_Array_0[1] = __VERIFIER_nondet_float() [L88] EXPR float_Array_0[1] [L88] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L88] EXPR float_Array_0[1] [L88] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L89] float_Array_0[2] = __VERIFIER_nondet_float() [L90] EXPR float_Array_0[2] [L90] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F [L90] EXPR float_Array_0[2] [L90] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] CALL assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] RET assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 9223372.036854765600e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L91] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L92] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L94] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L95] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L97] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L98] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L113] RET updateVariables() [L114] CALL step() [L44] BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L44] COND FALSE !(BOOL_unsigned_char_Array_0[2]) [L47] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L47] COND FALSE !(last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) [L51] EXPR unsigned_char_Array_0[1] [L51] signed_long_int_Array_0[0] = unsigned_char_Array_0[1] [L52] EXPR signed_long_int_Array_0[0] [L52] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L52] COND FALSE !(signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) [L63] EXPR float_Array_0[1] [L63] float_Array_0[0] = float_Array_0[1] [L65] EXPR unsigned_char_Array_0[1] [L65] EXPR unsigned_char_Array_0[1] [L65] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L65] EXPR ((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0])) [L65] EXPR unsigned_char_Array_0[1] [L65] EXPR signed_long_int_Array_0[0] [L65] EXPR ((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L65] signed long int stepLocal_0 = (((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))); [L66] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L66] COND TRUE unsigned_char_Array_0[1] <= stepLocal_0 [L67] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L67] COND TRUE ! BOOL_unsigned_char_Array_0[2] [L68] EXPR double_Array_0[0] [L68] double_Array_0[1] = double_Array_0[0] [L73] EXPR signed_char_Array_0[1] [L73] signed_char_Array_0[0] = signed_char_Array_0[1] [L114] RET step() [L115] CALL, EXPR property() [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0])) [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR signed_long_int_Array_0[0] [L105] EXPR ((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1 [L105] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0])) [L105] EXPR double_Array_0[1] [L105] EXPR double_Array_0[0] [L105] EXPR (! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1])))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1])))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1])))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1])))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105-L106] return (((((unsigned_char_Array_0[1] <= ((((unsigned_char_Array_0[1]) > ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))) ? (unsigned_char_Array_0[1]) : ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0]))))) ? ((! BOOL_unsigned_char_Array_0[2]) ? (double_Array_0[1] == ((double) double_Array_0[0])) : (double_Array_0[1] == ((double) double_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[2] ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) > (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : ((last_1_float_Array_0_0_ < (last_1_float_Array_0_0_ + double_Array_0[0])) ? (unsigned_char_Array_0[1] == ((unsigned char) ((((unsigned_char_Array_0[0]) < (unsigned_char_Array_0[2])) ? (unsigned_char_Array_0[0]) : (unsigned_char_Array_0[2]))))) : 1))) && ((signed_long_int_Array_0[0] > unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[2] ? (float_Array_0[0] == ((float) (float_Array_0[1] - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (float_Array_0[0] == ((float) (float_Array_0[1] - float_Array_0[2]))) : (float_Array_0[0] == ((float) float_Array_0[2])))) : (float_Array_0[0] == ((float) float_Array_0[1])))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) && (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[1])) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_float_Array_0_0_=63/4, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1084 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1084 mSDsluCounter, 5608 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3900 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1905 IncrementalHoareTripleChecker+Invalid, 1926 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 1708 mSDtfsCounter, 1905 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 596 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=320occurred in iteration=7, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 384 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1954 NumberOfCodeBlocks, 1954 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1808 ConstructedInterpolants, 0 QuantifiedInterpolants, 4000 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1817 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 5726/5880 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:09:54,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 526662cda712a72aaa9b0b3d772735b85caa85c8f8cefc4189404860ae784fc7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:09:56,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:09:56,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:09:56,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:09:56,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:09:56,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:09:56,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:09:56,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:09:56,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:09:56,243 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:09:56,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:09:56,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:09:56,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:09:56,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:09:56,245 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:09:56,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:09:56,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:09:56,245 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:09:56,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:09:56,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:09:56,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:09:56,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:09:56,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:09:56,245 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:09:56,245 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:09:56,245 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:09:56,245 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:09:56,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:09:56,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:09:56,246 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:09:56,246 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:09:56,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:09:56,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:09:56,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:09:56,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:09:56,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:09:56,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:09:56,246 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:09:56,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:09:56,246 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:09:56,246 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:09:56,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:09:56,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:09:56,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:09:56,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:09:56,248 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 526662cda712a72aaa9b0b3d772735b85caa85c8f8cefc4189404860ae784fc7 [2025-03-04 01:09:56,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:09:56,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:09:56,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:09:56,503 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:09:56,503 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:09:56,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i [2025-03-04 01:09:57,651 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6c4b3452/4fa4e1c622cd4ec7be48dd3d64041cab/FLAGfcba412bb [2025-03-04 01:09:57,858 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:09:57,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-73.i [2025-03-04 01:09:57,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6c4b3452/4fa4e1c622cd4ec7be48dd3d64041cab/FLAGfcba412bb [2025-03-04 01:09:58,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6c4b3452/4fa4e1c622cd4ec7be48dd3d64041cab [2025-03-04 01:09:58,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:09:58,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:09:58,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:09:58,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:09:58,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:09:58,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:09:58" (1/1) ... [2025-03-04 01:09:58,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29030396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:58, skipping insertion in model container [2025-03-04 01:09:58,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:09:58" (1/1) ... [2025-03-04 01:09:58,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:09:58,342 WARN L250 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-73.i[916,929] [2025-03-04 01:09:58,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:09:58,391 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:09:58,403 WARN L250 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-73.i[916,929] [2025-03-04 01:09:58,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:09:58,478 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:09:58,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:58 WrapperNode [2025-03-04 01:09:58,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:09:58,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:09:58,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:09:58,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:09:58,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:58" (1/1) ... [2025-03-04 01:09:58,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:58" (1/1) ... [2025-03-04 01:09:58,542 INFO L138 Inliner]: procedures = 36, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 496 [2025-03-04 01:09:58,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:09:58,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:09:58,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:09:58,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:09:58,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:58" (1/1) ... [2025-03-04 01:09:58,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:58" (1/1) ... [2025-03-04 01:09:58,559 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:58" (1/1) ... [2025-03-04 01:09:58,588 INFO L175 MemorySlicer]: Split 134 memory accesses to 7 slices as follows [2, 22, 17, 32, 9, 9, 43]. 32 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 2, 3, 2, 1, 3]. The 19 writes are split as follows [0, 3, 3, 6, 2, 1, 4]. [2025-03-04 01:09:58,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:58" (1/1) ... [2025-03-04 01:09:58,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:58" (1/1) ... [2025-03-04 01:09:58,619 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:58" (1/1) ... [2025-03-04 01:09:58,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:58" (1/1) ... [2025-03-04 01:09:58,632 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:58" (1/1) ... [2025-03-04 01:09:58,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:58" (1/1) ... [2025-03-04 01:09:58,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:09:58,643 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:09:58,643 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:09:58,643 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:09:58,644 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:58" (1/1) ... [2025-03-04 01:09:58,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:09:58,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:09:58,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:09:58,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:09:58,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:09:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-04 01:09:58,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:09:58,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:09:58,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:09:58,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-04 01:09:58,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:09:58,695 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:09:58,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:09:58,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:09:58,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:09:58,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:09:58,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:09:58,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:09:58,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-04 01:09:58,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:09:58,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:09:58,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:09:58,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:09:58,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:09:58,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-04 01:09:58,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-04 01:09:58,843 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:09:58,845 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:10:01,131 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L105: havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite97#1;havoc property_#t~mem91#1;havoc property_#t~ite96#1;havoc property_#t~mem93#1;havoc property_#t~mem92#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem98#1;havoc property_#t~ite113#1;havoc property_#t~mem104#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite132#1;havoc property_#t~mem117#1;havoc property_#t~ite129#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~short122#1;havoc property_#t~ite128#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2025-03-04 01:10:01,157 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2025-03-04 01:10:01,158 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:10:01,168 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:10:01,168 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:10:01,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:10:01 BoogieIcfgContainer [2025-03-04 01:10:01,168 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:10:01,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:10:01,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:10:01,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:10:01,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:09:58" (1/3) ... [2025-03-04 01:10:01,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7739e364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:10:01, skipping insertion in model container [2025-03-04 01:10:01,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:58" (2/3) ... [2025-03-04 01:10:01,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7739e364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:10:01, skipping insertion in model container [2025-03-04 01:10:01,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:10:01" (3/3) ... [2025-03-04 01:10:01,175 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-73.i [2025-03-04 01:10:01,185 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:10:01,186 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-73.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:10:01,222 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:10:01,230 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;@3035ae23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:10:01,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:10:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 92 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:10:01,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:10:01,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:01,243 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:01,243 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:01,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:01,247 INFO L85 PathProgramCache]: Analyzing trace with hash -655888968, now seen corresponding path program 1 times [2025-03-04 01:10:01,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:01,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158109008] [2025-03-04 01:10:01,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:01,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:01,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:01,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:01,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:10:01,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:10:01,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:10:01,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:01,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:01,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:10:01,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:01,621 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-04 01:10:01,622 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:01,622 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:01,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158109008] [2025-03-04 01:10:01,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158109008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:01,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:01,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:10:01,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222036473] [2025-03-04 01:10:01,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:01,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:10:01,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:01,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:10:01,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:10:01,645 INFO L87 Difference]: Start difference. First operand has 109 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 92 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:10:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:01,677 INFO L93 Difference]: Finished difference Result 212 states and 330 transitions. [2025-03-04 01:10:01,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:10:01,678 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2025-03-04 01:10:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:01,683 INFO L225 Difference]: With dead ends: 212 [2025-03-04 01:10:01,684 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 01:10:01,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:10:01,688 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:01,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 01:10:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-04 01:10:01,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:10:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2025-03-04 01:10:01,719 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2025-03-04 01:10:01,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:01,719 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2025-03-04 01:10:01,719 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:10:01,719 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2025-03-04 01:10:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:10:01,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:01,725 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:01,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:10:01,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:01,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:01,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:01,927 INFO L85 PathProgramCache]: Analyzing trace with hash 33216473, now seen corresponding path program 1 times [2025-03-04 01:10:01,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:01,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716234664] [2025-03-04 01:10:01,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:01,927 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 [2025-03-04 01:10:01,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:01,929 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:01,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:10:02,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:10:02,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:10:02,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:02,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:02,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:10:02,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:10:02,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:02,308 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:02,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716234664] [2025-03-04 01:10:02,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716234664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:02,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:02,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:10:02,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385070091] [2025-03-04 01:10:02,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:02,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:10:02,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:02,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:10:02,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:02,310 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:10:02,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:02,364 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2025-03-04 01:10:02,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:10:02,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-03-04 01:10:02,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:02,367 INFO L225 Difference]: With dead ends: 211 [2025-03-04 01:10:02,368 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 01:10:02,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:02,370 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:02,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 01:10:02,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-04 01:10:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:10:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2025-03-04 01:10:02,382 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 129 [2025-03-04 01:10:02,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:02,383 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2025-03-04 01:10:02,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:10:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2025-03-04 01:10:02,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:10:02,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:02,384 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:02,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:10:02,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:02,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:02,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:02,590 INFO L85 PathProgramCache]: Analyzing trace with hash -904935177, now seen corresponding path program 1 times [2025-03-04 01:10:02,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:02,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904501973] [2025-03-04 01:10:02,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:02,590 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 [2025-03-04 01:10:02,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:02,592 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:02,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:10:02,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:10:02,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:10:02,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:02,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:02,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:10:02,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:10:02,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:02,919 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:02,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904501973] [2025-03-04 01:10:02,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904501973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:02,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:02,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:10:02,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184377261] [2025-03-04 01:10:02,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:02,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:10:02,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:02,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:10:02,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:10:02,920 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:10:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:02,978 INFO L93 Difference]: Finished difference Result 218 states and 318 transitions. [2025-03-04 01:10:02,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:10:02,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-04 01:10:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:02,983 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:10:02,983 INFO L226 Difference]: Without dead ends: 113 [2025-03-04 01:10:02,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:10:02,984 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:02,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-04 01:10:02,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-03-04 01:10:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:10:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2025-03-04 01:10:02,994 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 131 [2025-03-04 01:10:02,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:02,994 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2025-03-04 01:10:02,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:10:02,994 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2025-03-04 01:10:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:10:02,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:02,995 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:03,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:10:03,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:03,196 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:03,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:03,197 INFO L85 PathProgramCache]: Analyzing trace with hash -17431496, now seen corresponding path program 1 times [2025-03-04 01:10:03,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:03,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41000583] [2025-03-04 01:10:03,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:03,197 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 [2025-03-04 01:10:03,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:03,203 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:03,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:10:03,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:10:03,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:10:03,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:03,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:03,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:10:03,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:03,545 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:10:03,545 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:03,545 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:03,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41000583] [2025-03-04 01:10:03,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41000583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:03,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:03,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:10:03,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076447273] [2025-03-04 01:10:03,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:03,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:10:03,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:03,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:10:03,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:03,546 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:10:03,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:03,606 INFO L93 Difference]: Finished difference Result 224 states and 323 transitions. [2025-03-04 01:10:03,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:10:03,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-03-04 01:10:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:03,607 INFO L225 Difference]: With dead ends: 224 [2025-03-04 01:10:03,607 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 01:10:03,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:03,608 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:03,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:03,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 01:10:03,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-03-04 01:10:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:10:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2025-03-04 01:10:03,614 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 131 [2025-03-04 01:10:03,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:03,614 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2025-03-04 01:10:03,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:10:03,614 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2025-03-04 01:10:03,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:10:03,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:03,615 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:03,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:10:03,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:03,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:03,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:03,817 INFO L85 PathProgramCache]: Analyzing trace with hash -16507975, now seen corresponding path program 1 times [2025-03-04 01:10:03,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:03,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539421211] [2025-03-04 01:10:03,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:03,817 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 [2025-03-04 01:10:03,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:03,820 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:03,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:10:03,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:10:04,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:10:04,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:04,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:04,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:10:04,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:04,269 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 [2025-03-04 01:10:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-04 01:10:04,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:04,301 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:04,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539421211] [2025-03-04 01:10:04,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539421211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:04,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:04,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:10:04,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937236238] [2025-03-04 01:10:04,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:04,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:10:04,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:04,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:10:04,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:04,303 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:10:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:06,483 INFO L93 Difference]: Finished difference Result 226 states and 324 transitions. [2025-03-04 01:10:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:10:06,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-03-04 01:10:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:06,485 INFO L225 Difference]: With dead ends: 226 [2025-03-04 01:10:06,485 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 01:10:06,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:10:06,486 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 123 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:06,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 488 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 01:10:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 01:10:06,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-03-04 01:10:06,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:10:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2025-03-04 01:10:06,491 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 131 [2025-03-04 01:10:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:06,491 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2025-03-04 01:10:06,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:10:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2025-03-04 01:10:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:10:06,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:06,493 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:06,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-04 01:10:06,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:06,693 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:06,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:06,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1277153335, now seen corresponding path program 1 times [2025-03-04 01:10:06,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:06,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64292179] [2025-03-04 01:10:06,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:06,694 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 [2025-03-04 01:10:06,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:06,696 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:06,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:10:06,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:10:06,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:10:06,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:06,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:06,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:10:06,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:07,093 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 [2025-03-04 01:10:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-03-04 01:10:07,112 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:07,113 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:07,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64292179] [2025-03-04 01:10:07,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64292179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:07,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:07,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:10:07,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709802518] [2025-03-04 01:10:07,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:07,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:10:07,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:07,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:10:07,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:07,114 INFO L87 Difference]: Start difference. First operand 114 states and 162 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:10:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:09,179 INFO L93 Difference]: Finished difference Result 226 states and 322 transitions. [2025-03-04 01:10:09,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:10:09,179 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2025-03-04 01:10:09,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:09,180 INFO L225 Difference]: With dead ends: 226 [2025-03-04 01:10:09,180 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 01:10:09,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:10:09,181 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 113 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:09,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 483 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 01:10:09,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 01:10:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2025-03-04 01:10:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:10:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 161 transitions. [2025-03-04 01:10:09,188 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 161 transitions. Word has length 133 [2025-03-04 01:10:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:09,192 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 161 transitions. [2025-03-04 01:10:09,193 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:10:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 161 transitions. [2025-03-04 01:10:09,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:10:09,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:09,194 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:09,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-04 01:10:09,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:09,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:09,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:09,395 INFO L85 PathProgramCache]: Analyzing trace with hash 405877945, now seen corresponding path program 1 times [2025-03-04 01:10:09,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:09,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311511514] [2025-03-04 01:10:09,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:09,396 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 [2025-03-04 01:10:09,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:09,397 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:09,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:10:09,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:10:09,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:10:09,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:09,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:09,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:10:09,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:09,711 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 [2025-03-04 01:10:09,740 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 36 treesize of output 18 [2025-03-04 01:10:09,747 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 17 treesize of output 9 [2025-03-04 01:10:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:10:09,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:09,794 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:09,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311511514] [2025-03-04 01:10:09,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311511514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:09,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:09,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:10:09,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867862172] [2025-03-04 01:10:09,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:09,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:10:09,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:09,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:10:09,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:09,795 INFO L87 Difference]: Start difference. First operand 114 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:10:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:10,756 INFO L93 Difference]: Finished difference Result 284 states and 403 transitions. [2025-03-04 01:10:10,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:10:10,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-03-04 01:10:10,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:10,757 INFO L225 Difference]: With dead ends: 284 [2025-03-04 01:10:10,757 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 01:10:10,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:10:10,758 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 143 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:10,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 489 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 01:10:10,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 01:10:10,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 114. [2025-03-04 01:10:10,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 97 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:10:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2025-03-04 01:10:10,773 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 135 [2025-03-04 01:10:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:10,774 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2025-03-04 01:10:10,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:10:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2025-03-04 01:10:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:10:10,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:10,775 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:10,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-04 01:10:10,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:10,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:10,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:10,976 INFO L85 PathProgramCache]: Analyzing trace with hash 617228858, now seen corresponding path program 1 times [2025-03-04 01:10:10,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:10,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743012281] [2025-03-04 01:10:10,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:10,977 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 [2025-03-04 01:10:10,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:10,978 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:10,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:10:11,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:10:11,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:10:11,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:11,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:11,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 01:10:11,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:11,275 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 [2025-03-04 01:10:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:10:11,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:11,387 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:11,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743012281] [2025-03-04 01:10:11,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743012281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:11,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:11,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:10:11,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238803438] [2025-03-04 01:10:11,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:11,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:10:11,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:11,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:10:11,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:11,389 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:10:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:12,944 INFO L93 Difference]: Finished difference Result 284 states and 401 transitions. [2025-03-04 01:10:12,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:10:12,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-03-04 01:10:12,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:12,945 INFO L225 Difference]: With dead ends: 284 [2025-03-04 01:10:12,945 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 01:10:12,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:12,946 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 139 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:12,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 619 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 01:10:12,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 01:10:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 114. [2025-03-04 01:10:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3298969072164948) internal successors, (129), 97 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:10:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2025-03-04 01:10:12,956 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 135 [2025-03-04 01:10:12,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:12,956 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2025-03-04 01:10:12,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:10:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2025-03-04 01:10:12,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:10:12,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:12,958 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:12,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-04 01:10:13,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:13,159 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:13,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:13,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2095368500, now seen corresponding path program 1 times [2025-03-04 01:10:13,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:13,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416731331] [2025-03-04 01:10:13,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:13,160 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 [2025-03-04 01:10:13,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:13,162 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:13,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-04 01:10:13,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:10:13,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:10:13,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:13,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:13,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:10:13,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:13,474 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 [2025-03-04 01:10:13,543 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 36 treesize of output 18 [2025-03-04 01:10:13,547 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 17 treesize of output 9 [2025-03-04 01:10:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:10:13,573 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:13,573 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:13,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416731331] [2025-03-04 01:10:13,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416731331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:13,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:13,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:10:13,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827882478] [2025-03-04 01:10:13,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:13,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:10:13,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:13,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:10:13,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:10:13,574 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:10:15,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:15,513 INFO L93 Difference]: Finished difference Result 284 states and 399 transitions. [2025-03-04 01:10:15,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:10:15,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2025-03-04 01:10:15,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:15,515 INFO L225 Difference]: With dead ends: 284 [2025-03-04 01:10:15,515 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 01:10:15,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:15,515 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 135 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:15,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 577 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 01:10:15,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 01:10:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 114. [2025-03-04 01:10:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 97 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:10:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 158 transitions. [2025-03-04 01:10:15,524 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 158 transitions. Word has length 136 [2025-03-04 01:10:15,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:15,524 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 158 transitions. [2025-03-04 01:10:15,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:10:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 158 transitions. [2025-03-04 01:10:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:10:15,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:15,525 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:15,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2025-03-04 01:10:15,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:15,726 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:15,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:15,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1689064619, now seen corresponding path program 1 times [2025-03-04 01:10:15,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:15,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721302303] [2025-03-04 01:10:15,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:15,727 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 [2025-03-04 01:10:15,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:15,728 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:15,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-04 01:10:15,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:10:16,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:10:16,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:16,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:16,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 01:10:16,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:16,197 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 [2025-03-04 01:10:17,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:10:17,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 98 [2025-03-04 01:10:17,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:10:17,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 368 treesize of output 134 [2025-03-04 01:10:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-04 01:10:17,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:10:17,608 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:17,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721302303] [2025-03-04 01:10:17,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721302303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:10:17,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [110314669] [2025-03-04 01:10:17,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:17,609 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:10:17,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:10:17,610 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:10:17,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-04 01:10:17,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:10:18,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:10:18,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:18,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:18,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:10:18,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:19,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-04 01:10:20,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:10:20,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 100 [2025-03-04 01:10:21,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:10:21,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 326 treesize of output 142 [2025-03-04 01:10:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-04 01:10:21,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:10:21,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [110314669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:10:21,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:10:21,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2025-03-04 01:10:21,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967362136] [2025-03-04 01:10:21,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:10:21,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:10:21,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:21,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:10:21,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:10:21,314 INFO L87 Difference]: Start difference. First operand 114 states and 158 transitions. Second operand has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 16 states have internal predecessors, (121), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-04 01:10:32,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:10:32,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:32,839 INFO L93 Difference]: Finished difference Result 349 states and 484 transitions. [2025-03-04 01:10:32,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:10:32,840 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 16 states have internal predecessors, (121), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 136 [2025-03-04 01:10:32,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:32,841 INFO L225 Difference]: With dead ends: 349 [2025-03-04 01:10:32,841 INFO L226 Difference]: Without dead ends: 238 [2025-03-04 01:10:32,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:10:32,842 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 323 mSDsluCounter, 1940 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:32,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 2173 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2025-03-04 01:10:32,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-04 01:10:32,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 232. [2025-03-04 01:10:32,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 192 states have (on average 1.3072916666666667) internal successors, (251), 194 states have internal predecessors, (251), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:10:32,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 323 transitions. [2025-03-04 01:10:32,857 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 323 transitions. Word has length 136 [2025-03-04 01:10:32,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:32,857 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 323 transitions. [2025-03-04 01:10:32,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 16 states have internal predecessors, (121), 4 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-04 01:10:32,858 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 323 transitions. [2025-03-04 01:10:32,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:10:32,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:32,858 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:32,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-04 01:10:33,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2025-03-04 01:10:33,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:10:33,259 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:33,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:33,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1930210068, now seen corresponding path program 1 times [2025-03-04 01:10:33,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:33,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818951410] [2025-03-04 01:10:33,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:33,260 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 [2025-03-04 01:10:33,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:33,262 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:33,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-03-04 01:10:33,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:10:33,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:10:33,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:33,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:33,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:10:33,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-04 01:10:33,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:33,551 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:33,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818951410] [2025-03-04 01:10:33,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818951410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:33,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:33,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:10:33,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175678079] [2025-03-04 01:10:33,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:33,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:10:33,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:33,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:10:33,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:33,552 INFO L87 Difference]: Start difference. First operand 232 states and 323 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:10:33,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:33,619 INFO L93 Difference]: Finished difference Result 448 states and 624 transitions. [2025-03-04 01:10:33,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:10:33,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-03-04 01:10:33,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:33,622 INFO L225 Difference]: With dead ends: 448 [2025-03-04 01:10:33,624 INFO L226 Difference]: Without dead ends: 232 [2025-03-04 01:10:33,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:33,625 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:33,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 436 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:10:33,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-04 01:10:33,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-03-04 01:10:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 192 states have (on average 1.3020833333333333) internal successors, (250), 194 states have internal predecessors, (250), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:10:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 322 transitions. [2025-03-04 01:10:33,649 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 322 transitions. Word has length 136 [2025-03-04 01:10:33,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:33,649 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 322 transitions. [2025-03-04 01:10:33,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:10:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 322 transitions. [2025-03-04 01:10:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 01:10:33,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:33,651 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:33,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-03-04 01:10:33,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:33,852 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:33,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:33,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1857202199, now seen corresponding path program 1 times [2025-03-04 01:10:33,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:33,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3321769] [2025-03-04 01:10:33,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:33,853 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 [2025-03-04 01:10:33,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:33,855 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:33,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-03-04 01:10:33,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:10:34,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:10:34,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:34,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:34,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 01:10:34,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:34,344 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 18 treesize of output 19 [2025-03-04 01:10:38,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:10:38,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 104 [2025-03-04 01:10:39,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:10:39,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 339 treesize of output 149 [2025-03-04 01:10:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 8 proven. 240 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-04 01:10:39,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:10:39,528 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:39,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3321769] [2025-03-04 01:10:39,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3321769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:10:39,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1463625079] [2025-03-04 01:10:39,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:39,528 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:10:39,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:10:39,530 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:10:39,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2025-03-04 01:10:39,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:10:41,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:10:41,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:41,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:41,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 01:10:41,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:43,958 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 47 treesize of output 23 [2025-03-04 01:10:47,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-04 01:11:14,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:14,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 114