./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.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-17.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 cf9505dc2ef67c73c85afca644466d8e73c9d84bcc3bdb502bf9c06807a1f2ea --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:02:34,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:02:35,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:02:35,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:02:35,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:02:35,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:02:35,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:02:35,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:02:35,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:02:35,056 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:02:35,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:02:35,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:02:35,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:02:35,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:02:35,057 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:02:35,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:02:35,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:02:35,058 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:02:35,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:02:35,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:02:35,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:02:35,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:02:35,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:02:35,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:02:35,058 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:02:35,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:02:35,058 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:02:35,058 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:02:35,059 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:02:35,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:02:35,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:02:35,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:02:35,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:02:35,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:02:35,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:02:35,059 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:02:35,059 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:02:35,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:02:35,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:02:35,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:02:35,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:02:35,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:02:35,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:02:35,059 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 -> cf9505dc2ef67c73c85afca644466d8e73c9d84bcc3bdb502bf9c06807a1f2ea [2025-03-04 01:02:35,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:02:35,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:02:35,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:02:35,296 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:02:35,296 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:02:35,297 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-17.i [2025-03-04 01:02:36,453 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b0854cc5/ae5308880f6c412ba520927064ca990e/FLAG4f8263365 [2025-03-04 01:02:36,680 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:02:36,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i [2025-03-04 01:02:36,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b0854cc5/ae5308880f6c412ba520927064ca990e/FLAG4f8263365 [2025-03-04 01:02:36,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b0854cc5/ae5308880f6c412ba520927064ca990e [2025-03-04 01:02:36,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:02:36,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:02:36,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:02:36,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:02:36,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:02:36,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:02:36" (1/1) ... [2025-03-04 01:02:36,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20407ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:36, skipping insertion in model container [2025-03-04 01:02:36,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:02:36" (1/1) ... [2025-03-04 01:02:36,745 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:02:36,858 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-17.i[916,929] [2025-03-04 01:02:36,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:02:36,936 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:02:36,944 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-17.i[916,929] [2025-03-04 01:02:36,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:02:36,991 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:02:36,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:36 WrapperNode [2025-03-04 01:02:36,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:02:36,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:02:36,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:02:36,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:02:36,999 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:02:36" (1/1) ... [2025-03-04 01:02:37,008 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:02:36" (1/1) ... [2025-03-04 01:02:37,037 INFO L138 Inliner]: procedures = 29, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 623 [2025-03-04 01:02:37,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:02:37,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:02:37,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:02:37,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:02:37,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:36" (1/1) ... [2025-03-04 01:02:37,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:36" (1/1) ... [2025-03-04 01:02:37,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:36" (1/1) ... [2025-03-04 01:02:37,075 INFO L175 MemorySlicer]: Split 156 memory accesses to 7 slices as follows [2, 14, 89, 3, 21, 22, 5]. 57 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 7, 1, 3, 2, 1]. The 19 writes are split as follows [0, 2, 7, 1, 5, 3, 1]. [2025-03-04 01:02:37,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:36" (1/1) ... [2025-03-04 01:02:37,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:36" (1/1) ... [2025-03-04 01:02:37,093 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:36" (1/1) ... [2025-03-04 01:02:37,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:36" (1/1) ... [2025-03-04 01:02:37,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:36" (1/1) ... [2025-03-04 01:02:37,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:36" (1/1) ... [2025-03-04 01:02:37,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:02:37,105 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:02:37,105 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:02:37,105 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:02:37,105 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:36" (1/1) ... [2025-03-04 01:02:37,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:02:37,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:37,139 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:02:37,142 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:02:37,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:02:37,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:02:37,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:02:37,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:02:37,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:02:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:02:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:02:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:02:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:02:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:02:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:02:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:02:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:02:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-04 01:02:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:02:37,164 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:02:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:02:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:02:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:02:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:02:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:02:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:02:37,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:02:37,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:02:37,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:02:37,305 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:02:37,307 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:02:37,730 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L105: havoc property_#t~mem114#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite137#1;havoc property_#t~mem128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite136#1;havoc property_#t~mem130#1;havoc property_#t~ite133#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short138#1;havoc property_#t~mem139#1;havoc property_#t~short140#1;havoc property_#t~mem143#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite166#1;havoc property_#t~mem165#1;havoc property_#t~mem153#1;havoc property_#t~mem144#1;havoc property_#t~ite146#1;havoc property_#t~mem145#1;havoc property_#t~mem147#1;havoc property_#t~ite152#1;havoc property_#t~mem148#1;havoc property_#t~ite150#1;havoc property_#t~mem149#1;havoc property_#t~mem151#1;havoc property_#t~ite164#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~mem158#1;havoc property_#t~ite163#1;havoc property_#t~mem159#1;havoc property_#t~ite161#1;havoc property_#t~mem160#1;havoc property_#t~mem162#1;havoc property_#t~short167#1;havoc property_#t~mem168#1;havoc property_#t~mem169#1;havoc property_#t~ite177#1;havoc property_#t~mem170#1;havoc property_#t~mem171#1;havoc property_#t~ite176#1;havoc property_#t~mem173#1;havoc property_#t~mem172#1;havoc property_#t~mem175#1;havoc property_#t~mem174#1;havoc property_#t~short178#1; [2025-03-04 01:02:37,784 INFO L? ?]: Removed 167 outVars from TransFormulas that were not future-live. [2025-03-04 01:02:37,784 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:02:37,796 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:02:37,796 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:02:37,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:02:37 BoogieIcfgContainer [2025-03-04 01:02:37,796 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:02:37,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:02:37,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:02:37,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:02:37,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:02:36" (1/3) ... [2025-03-04 01:02:37,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e19b50b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:02:37, skipping insertion in model container [2025-03-04 01:02:37,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:36" (2/3) ... [2025-03-04 01:02:37,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e19b50b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:02:37, skipping insertion in model container [2025-03-04 01:02:37,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:02:37" (3/3) ... [2025-03-04 01:02:37,804 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-17.i [2025-03-04 01:02:37,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:02:37,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-17.i that has 2 procedures, 143 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:02:37,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:02:37,869 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;@330b2c72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:02:37,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:02:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 125 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:02:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:02:37,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:37,883 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:37,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:37,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:37,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1179683822, now seen corresponding path program 1 times [2025-03-04 01:02:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:37,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915544289] [2025-03-04 01:02:37,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:37,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:38,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:02:38,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:02:38,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:38,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:38,147 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-04 01:02:38,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:38,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915544289] [2025-03-04 01:02:38,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915544289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:38,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987349631] [2025-03-04 01:02:38,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:38,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:38,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:38,152 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:02:38,153 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:02:38,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:02:38,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:02:38,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:38,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:38,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:02:38,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-04 01:02:38,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:38,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987349631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:38,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:02:38,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:02:38,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607364196] [2025-03-04 01:02:38,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:38,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:02:38,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:38,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:02:38,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:02:38,384 INFO L87 Difference]: Start difference. First operand has 143 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 125 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:02:38,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:38,406 INFO L93 Difference]: Finished difference Result 280 states and 435 transitions. [2025-03-04 01:02:38,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:02:38,408 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2025-03-04 01:02:38,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:38,412 INFO L225 Difference]: With dead ends: 280 [2025-03-04 01:02:38,412 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 01:02:38,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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:02:38,416 INFO L435 NwaCegarLoop]: 207 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, 207 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:02:38,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:02:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 01:02:38,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-03-04 01:02:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:02:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2025-03-04 01:02:38,452 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 141 [2025-03-04 01:02:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:38,452 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2025-03-04 01:02:38,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:02:38,453 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2025-03-04 01:02:38,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:02:38,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:38,457 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:38,464 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:02:38,657 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:02:38,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:38,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1745830744, now seen corresponding path program 1 times [2025-03-04 01:02:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:38,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458412737] [2025-03-04 01:02:38,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:38,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:38,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:02:38,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:02:38,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:38,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:39,021 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:02:39,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:39,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458412737] [2025-03-04 01:02:39,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458412737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:39,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314749702] [2025-03-04 01:02:39,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:39,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:39,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:39,025 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:02:39,029 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:02:39,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:02:39,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:02:39,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:39,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:39,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:02:39,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:39,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:39,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314749702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:39,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:02:39,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:02:39,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860565439] [2025-03-04 01:02:39,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:39,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:02:39,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:39,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:02:39,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:02:39,271 INFO L87 Difference]: Start difference. First operand 140 states and 207 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:39,315 INFO L93 Difference]: Finished difference Result 280 states and 415 transitions. [2025-03-04 01:02:39,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:02:39,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2025-03-04 01:02:39,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:39,320 INFO L225 Difference]: With dead ends: 280 [2025-03-04 01:02:39,321 INFO L226 Difference]: Without dead ends: 143 [2025-03-04 01:02:39,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 141 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:02:39,322 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 1 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 601 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:02:39,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 601 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:02:39,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-04 01:02:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2025-03-04 01:02:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:02:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2025-03-04 01:02:39,331 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 141 [2025-03-04 01:02:39,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:39,332 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2025-03-04 01:02:39,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:39,332 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2025-03-04 01:02:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:02:39,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:39,333 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:39,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:02:39,534 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:02:39,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:39,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:39,535 INFO L85 PathProgramCache]: Analyzing trace with hash 741682089, now seen corresponding path program 1 times [2025-03-04 01:02:39,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:39,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689933680] [2025-03-04 01:02:39,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:39,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:39,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:02:39,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:02:39,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:39,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-04 01:02:39,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:39,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689933680] [2025-03-04 01:02:39,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689933680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:39,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235747585] [2025-03-04 01:02:39,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:39,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:39,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:39,777 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:02:39,779 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:02:39,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:02:39,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:02:39,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:39,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:39,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:02:39,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:39,984 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:39,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:39,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235747585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:39,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:02:39,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:02:39,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365665126] [2025-03-04 01:02:39,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:39,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:02:39,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:39,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:02:39,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:02:39,986 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:40,014 INFO L93 Difference]: Finished difference Result 283 states and 418 transitions. [2025-03-04 01:02:40,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:02:40,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2025-03-04 01:02:40,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:40,016 INFO L225 Difference]: With dead ends: 283 [2025-03-04 01:02:40,017 INFO L226 Difference]: Without dead ends: 144 [2025-03-04 01:02:40,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 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:02:40,018 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 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:02:40,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:02:40,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-04 01:02:40,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-04 01:02:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 126 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:02:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2025-03-04 01:02:40,025 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 141 [2025-03-04 01:02:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:40,030 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2025-03-04 01:02:40,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2025-03-04 01:02:40,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:02:40,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:40,031 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:40,039 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:02:40,231 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:02:40,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:40,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:40,232 INFO L85 PathProgramCache]: Analyzing trace with hash 661545767, now seen corresponding path program 1 times [2025-03-04 01:02:40,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:40,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736561372] [2025-03-04 01:02:40,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:40,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:40,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:02:40,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:02:40,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:40,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:40,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:40,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736561372] [2025-03-04 01:02:40,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736561372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:40,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:40,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:02:40,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270057043] [2025-03-04 01:02:40,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:40,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:02:40,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:40,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:02:40,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:02:40,766 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:02:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:40,852 INFO L93 Difference]: Finished difference Result 355 states and 518 transitions. [2025-03-04 01:02:40,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:02:40,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2025-03-04 01:02:40,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:40,855 INFO L225 Difference]: With dead ends: 355 [2025-03-04 01:02:40,855 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 01:02:40,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:02:40,856 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 94 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:40,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 953 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:02:40,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 01:02:40,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2025-03-04 01:02:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 190 states have (on average 1.4263157894736842) internal successors, (271), 191 states have internal predecessors, (271), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:02:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 307 transitions. [2025-03-04 01:02:40,875 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 307 transitions. Word has length 143 [2025-03-04 01:02:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:40,876 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 307 transitions. [2025-03-04 01:02:40,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:02:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 307 transitions. [2025-03-04 01:02:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:02:40,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:40,878 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:40,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:02:40,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:40,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:40,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1071728230, now seen corresponding path program 1 times [2025-03-04 01:02:40,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:40,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669861407] [2025-03-04 01:02:40,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:40,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:40,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:02:40,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:02:40,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:40,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:41,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:41,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669861407] [2025-03-04 01:02:41,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669861407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:41,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:41,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:02:41,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367350664] [2025-03-04 01:02:41,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:41,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:02:41,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:41,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:02:41,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:02:41,315 INFO L87 Difference]: Start difference. First operand 211 states and 307 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:41,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:41,375 INFO L93 Difference]: Finished difference Result 424 states and 618 transitions. [2025-03-04 01:02:41,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:02:41,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2025-03-04 01:02:41,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:41,379 INFO L225 Difference]: With dead ends: 424 [2025-03-04 01:02:41,380 INFO L226 Difference]: Without dead ends: 216 [2025-03-04 01:02:41,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:02:41,381 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 90 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:41,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 691 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:02:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-04 01:02:41,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2025-03-04 01:02:41,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 194 states have (on average 1.4175257731958764) internal successors, (275), 195 states have internal predecessors, (275), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:02:41,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 311 transitions. [2025-03-04 01:02:41,400 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 311 transitions. Word has length 143 [2025-03-04 01:02:41,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:41,400 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 311 transitions. [2025-03-04 01:02:41,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:41,401 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 311 transitions. [2025-03-04 01:02:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:02:41,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:41,402 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:41,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:02:41,402 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:41,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:41,402 INFO L85 PathProgramCache]: Analyzing trace with hash -735726233, now seen corresponding path program 1 times [2025-03-04 01:02:41,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:41,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736501204] [2025-03-04 01:02:41,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:41,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:41,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:02:41,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:02:41,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:41,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:42,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:42,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736501204] [2025-03-04 01:02:42,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736501204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:42,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:42,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:02:42,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939143454] [2025-03-04 01:02:42,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:42,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:02:42,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:42,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:02:42,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:02:42,048 INFO L87 Difference]: Start difference. First operand 215 states and 311 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:42,279 INFO L93 Difference]: Finished difference Result 857 states and 1243 transitions. [2025-03-04 01:02:42,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:02:42,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2025-03-04 01:02:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:42,282 INFO L225 Difference]: With dead ends: 857 [2025-03-04 01:02:42,282 INFO L226 Difference]: Without dead ends: 645 [2025-03-04 01:02:42,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:02:42,283 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 399 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:42,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1563 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:02:42,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-03-04 01:02:42,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 639. [2025-03-04 01:02:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 578 states have (on average 1.4169550173010381) internal successors, (819), 581 states have internal predecessors, (819), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:02:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 927 transitions. [2025-03-04 01:02:42,309 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 927 transitions. Word has length 143 [2025-03-04 01:02:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:42,310 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 927 transitions. [2025-03-04 01:02:42,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 927 transitions. [2025-03-04 01:02:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:02:42,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:42,312 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:42,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:02:42,312 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:42,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:42,312 INFO L85 PathProgramCache]: Analyzing trace with hash 383014304, now seen corresponding path program 1 times [2025-03-04 01:02:42,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:42,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261929497] [2025-03-04 01:02:42,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:42,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:42,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:02:42,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:02:42,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:42,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:02:42,374 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:02:42,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:02:42,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:02:42,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:42,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:02:42,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:02:42,462 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:02:42,462 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:02:42,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:02:42,467 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:42,556 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:02:42,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:02:42 BoogieIcfgContainer [2025-03-04 01:02:42,562 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:02:42,563 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:02:42,563 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:02:42,563 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:02:42,564 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:02:37" (3/4) ... [2025-03-04 01:02:42,566 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:02:42,566 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:02:42,567 INFO L158 Benchmark]: Toolchain (without parser) took 5838.45ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 113.3MB in the beginning and 109.6MB in the end (delta: 3.8MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. [2025-03-04 01:02:42,567 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:02:42,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.85ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 97.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:02:42,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.84ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 93.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:02:42,568 INFO L158 Benchmark]: Boogie Preprocessor took 65.95ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 88.7MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:02:42,569 INFO L158 Benchmark]: IcfgBuilder took 691.73ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 49.3MB in the end (delta: 38.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:02:42,569 INFO L158 Benchmark]: TraceAbstraction took 4764.35ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 48.8MB in the beginning and 109.6MB in the end (delta: -60.9MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2025-03-04 01:02:42,569 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 218.1MB. Free memory was 109.6MB in the beginning and 109.6MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:02:42,571 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.21ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.85ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 97.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.84ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 93.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.95ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 88.7MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 691.73ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 49.3MB in the end (delta: 38.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4764.35ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 48.8MB in the beginning and 109.6MB in the end (delta: -60.9MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 218.1MB. Free memory was 109.6MB in the beginning and 109.6MB in the end (delta: 42.1kB). 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 someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L25-L27] double double_Array_0[7] = { 9.4, 4.5, 3.5, 49.6, 7.5, 16.2, 10000000.8 }; [L28-L30] float float_Array_0[1] = { 128.4 }; [L28-L30] float float_Array_0[1] = { 128.4 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { 128, 128, -10 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { 128, 128, -10 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { 128, 128, -10 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { 128, 128, -10 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 2, 16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 2, 16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 2, 16 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 100 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 100 }; [L40] unsigned char last_1_unsigned_char_Array_0_1_ = 16; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] CALL updateLastVariables() [L102] EXPR unsigned_char_Array_0[1] [L102] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L112] RET updateLastVariables() [L113] CALL updateVariables() [L73] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L74] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L77] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] double_Array_0[0] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[0] [L80] EXPR double_Array_0[0] >= 0.0F && 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L80] EXPR double_Array_0[0] [L80] EXPR double_Array_0[0] >= 0.0F && 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] double_Array_0[1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= 0.0F && double_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= 0.0F && double_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] double_Array_0[2] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[2] [L84] EXPR double_Array_0[2] >= 0.0F && double_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L84] EXPR double_Array_0[2] [L84] EXPR double_Array_0[2] >= 0.0F && double_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854776000e+12F && double_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] double_Array_0[3] = __VERIFIER_nondet_double() [L86] EXPR double_Array_0[3] [L86] EXPR double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F [L86] EXPR double_Array_0[3] [L86] EXPR double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR (double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 2305843.009213691390e+12F && double_Array_0[3] >= 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] EXPR (double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 2305843.009213691390e+12F && double_Array_0[3] >= 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] CALL assume_abort_if_not((double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 2305843.009213691390e+12F && double_Array_0[3] >= 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] RET assume_abort_if_not((double_Array_0[3] >= -230584.3009213691390e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 2305843.009213691390e+12F && double_Array_0[3] >= 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] double_Array_0[4] = __VERIFIER_nondet_double() [L88] EXPR double_Array_0[4] [L88] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F [L88] EXPR double_Array_0[4] [L88] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] EXPR (double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] EXPR (double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] CALL assume_abort_if_not((double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] RET assume_abort_if_not((double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] double_Array_0[5] = __VERIFIER_nondet_double() [L90] EXPR double_Array_0[5] [L90] EXPR double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] EXPR double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F [L90] EXPR double_Array_0[5] [L90] EXPR double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] EXPR (double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F) || (double_Array_0[5] <= 4611686.018427382800e+12F && double_Array_0[5] >= 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] EXPR (double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F) || (double_Array_0[5] <= 4611686.018427382800e+12F && double_Array_0[5] >= 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] CALL assume_abort_if_not((double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F) || (double_Array_0[5] <= 4611686.018427382800e+12F && double_Array_0[5] >= 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] RET assume_abort_if_not((double_Array_0[5] >= -461168.6018427382800e+13F && double_Array_0[5] <= -1.0e-20F) || (double_Array_0[5] <= 4611686.018427382800e+12F && double_Array_0[5] >= 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L91] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L92] EXPR signed_short_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_short_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_short_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L93] EXPR signed_short_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L93] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L93] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L94] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L95] EXPR signed_short_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(signed_short_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L95] RET assume_abort_if_not(signed_short_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR signed_short_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L97] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L98] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L98] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L98] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L99] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L99] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L99] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L113] RET updateVariables() [L114] CALL step() [L44] unsigned_long_int_Array_0[0] = last_1_unsigned_char_Array_0_1_ [L45] EXPR unsigned_long_int_Array_0[0] [L45] unsigned long int stepLocal_1 = unsigned_long_int_Array_0[0]; [L46] EXPR signed_short_int_Array_0[0] [L46] signed short int stepLocal_0 = signed_short_int_Array_0[0]; [L47] EXPR signed_short_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L47] COND FALSE !(stepLocal_0 >= signed_short_int_Array_0[1]) [L54] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L54] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L57] EXPR double_Array_0[1] [L57] EXPR double_Array_0[0] [L57] EXPR double_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L57] COND FALSE !((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) [L60] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L60] COND FALSE !(BOOL_unsigned_char_Array_0[1]) [L65] EXPR unsigned_char_Array_0[1] [L65] signed_short_int_Array_0[2] = unsigned_char_Array_0[1] [L68] EXPR double_Array_0[1] [L68] EXPR double_Array_0[0] [L68] EXPR double_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] COND FALSE !(double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) [L114] RET step() [L115] CALL, EXPR property() [L105] 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1 [L105] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])))) [L105] EXPR double_Array_0[1] [L105] EXPR double_Array_0[0] [L105] EXPR double_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))) [L105] EXPR signed_short_int_Array_0[2] [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR unsigned_char_Array_0[1] [L105] EXPR ((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1)) && ((signed_short_int_Array_0[0] >= signed_short_int_Array_0[1]) ? (((signed_short_int_Array_0[0] + last_1_unsigned_char_Array_0_1_) >= unsigned_long_int_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105] EXPR ((((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1)) && ((signed_short_int_Array_0[0] >= signed_short_int_Array_0[1]) ? (((signed_short_int_Array_0[0] + last_1_unsigned_char_Array_0_1_) >= unsigned_long_int_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) 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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L105-L106] return ((((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[6] == ((double) (double_Array_0[5] + ((((double_Array_0[4]) < ((49.5 + double_Array_0[3]))) ? (double_Array_0[4]) : ((49.5 + double_Array_0[3]))))))) : 1) && (((- (double_Array_0[1] - double_Array_0[0])) <= double_Array_0[5]) ? (signed_short_int_Array_0[2] == ((signed short int) ((8 + unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (BOOL_unsigned_char_Array_0[1] ? (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1])) : 1) : (signed_short_int_Array_0[2] == ((signed short int) unsigned_char_Array_0[1]))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) last_1_unsigned_char_Array_0_1_))) && ((double_Array_0[1] < (double_Array_0[0] - double_Array_0[2])) ? (float_Array_0[0] == ((float) ((((double_Array_0[4]) > (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5]))))) ? (double_Array_0[4]) : (((((((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) > (double_Array_0[5])) ? (((((127.4f) > (double_Array_0[3])) ? (127.4f) : (double_Array_0[3])))) : (double_Array_0[5])))))))) : 1)) && ((signed_short_int_Array_0[0] >= signed_short_int_Array_0[1]) ? (((signed_short_int_Array_0[0] + last_1_unsigned_char_Array_0_1_) >= unsigned_long_int_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_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_unsigned_char_Array_0_1_=16, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 585 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 584 mSDsluCounter, 4619 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3297 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 365 IncrementalHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 1322 mSDtfsCounter, 365 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=639occurred in iteration=6, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1419 NumberOfCodeBlocks, 1419 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1266 ConstructedInterpolants, 0 QuantifiedInterpolants, 2095 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1437 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 4200/4320 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:02:42,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-17.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 cf9505dc2ef67c73c85afca644466d8e73c9d84bcc3bdb502bf9c06807a1f2ea --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:02:44,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:02:44,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:02:44,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:02:44,619 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:02:44,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:02:44,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:02:44,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:02:44,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:02:44,641 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:02:44,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:02:44,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:02:44,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:02:44,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:02:44,643 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:02:44,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:02:44,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:02:44,643 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:02:44,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:02:44,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:02:44,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:02:44,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:02:44,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:02:44,644 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:02:44,644 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:02:44,644 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:02:44,644 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:02:44,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:02:44,644 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:02:44,644 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:02:44,645 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:02:44,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:02:44,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:02:44,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:02:44,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:02:44,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:02:44,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:02:44,646 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:02:44,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:02:44,646 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:02:44,646 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:02:44,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:02:44,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:02:44,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:02:44,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:02:44,647 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 -> cf9505dc2ef67c73c85afca644466d8e73c9d84bcc3bdb502bf9c06807a1f2ea [2025-03-04 01:02:44,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:02:44,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:02:44,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:02:44,874 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:02:44,875 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:02:44,876 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-17.i [2025-03-04 01:02:46,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50be7474d/7f261cd9ac0d411ca49a304501b09937/FLAG828ead723 [2025-03-04 01:02:46,280 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:02:46,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-17.i [2025-03-04 01:02:46,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50be7474d/7f261cd9ac0d411ca49a304501b09937/FLAG828ead723 [2025-03-04 01:02:46,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50be7474d/7f261cd9ac0d411ca49a304501b09937 [2025-03-04 01:02:46,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:02:46,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:02:46,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:02:46,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:02:46,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:02:46,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3daaeeaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46, skipping insertion in model container [2025-03-04 01:02:46,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:02:46,449 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-17.i[916,929] [2025-03-04 01:02:46,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:02:46,534 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:02:46,544 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-17.i[916,929] [2025-03-04 01:02:46,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:02:46,600 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:02:46,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46 WrapperNode [2025-03-04 01:02:46,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:02:46,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:02:46,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:02:46,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:02:46,607 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:02:46" (1/1) ... [2025-03-04 01:02:46,626 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:02:46" (1/1) ... [2025-03-04 01:02:46,676 INFO L138 Inliner]: procedures = 39, calls = 189, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 621 [2025-03-04 01:02:46,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:02:46,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:02:46,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:02:46,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:02:46,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,714 INFO L175 MemorySlicer]: Split 156 memory accesses to 7 slices as follows [2, 14, 89, 3, 21, 22, 5]. 57 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 7, 1, 3, 2, 1]. The 19 writes are split as follows [0, 2, 7, 1, 5, 3, 1]. [2025-03-04 01:02:46,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,715 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,751 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:02:46,779 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:02:46,779 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:02:46,779 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:02:46,780 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:02:46,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:46,806 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:02:46,811 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:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:02:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-04 01:02:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-04 01:02:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:02:46,853 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:02:46,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-04 01:02:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-04 01:02:46,993 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:02:46,995 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:02:50,370 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L105: havoc property_#t~mem114#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite137#1;havoc property_#t~mem128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite136#1;havoc property_#t~mem130#1;havoc property_#t~ite133#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short138#1;havoc property_#t~mem139#1;havoc property_#t~short140#1;havoc property_#t~mem143#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite166#1;havoc property_#t~mem165#1;havoc property_#t~mem153#1;havoc property_#t~mem144#1;havoc property_#t~ite146#1;havoc property_#t~mem145#1;havoc property_#t~mem147#1;havoc property_#t~ite152#1;havoc property_#t~mem148#1;havoc property_#t~ite150#1;havoc property_#t~mem149#1;havoc property_#t~mem151#1;havoc property_#t~ite164#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~mem158#1;havoc property_#t~ite163#1;havoc property_#t~mem159#1;havoc property_#t~ite161#1;havoc property_#t~mem160#1;havoc property_#t~mem162#1;havoc property_#t~short167#1;havoc property_#t~mem168#1;havoc property_#t~mem169#1;havoc property_#t~ite177#1;havoc property_#t~mem170#1;havoc property_#t~mem171#1;havoc property_#t~ite176#1;havoc property_#t~mem173#1;havoc property_#t~mem172#1;havoc property_#t~mem175#1;havoc property_#t~mem174#1;havoc property_#t~short178#1; [2025-03-04 01:02:50,401 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2025-03-04 01:02:50,402 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:02:50,415 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:02:50,416 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:02:50,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:02:50 BoogieIcfgContainer [2025-03-04 01:02:50,417 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:02:50,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:02:50,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:02:50,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:02:50,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:02:46" (1/3) ... [2025-03-04 01:02:50,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5027eb83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:02:50, skipping insertion in model container [2025-03-04 01:02:50,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (2/3) ... [2025-03-04 01:02:50,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5027eb83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:02:50, skipping insertion in model container [2025-03-04 01:02:50,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:02:50" (3/3) ... [2025-03-04 01:02:50,426 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-17.i [2025-03-04 01:02:50,438 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:02:50,439 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-17.i that has 2 procedures, 143 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:02:50,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:02:50,501 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;@139a7cd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:02:50,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:02:50,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 125 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:02:50,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:02:50,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:50,518 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:50,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:50,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:50,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1179683822, now seen corresponding path program 1 times [2025-03-04 01:02:50,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:02:50,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455346673] [2025-03-04 01:02:50,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:50,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:02:50,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:02:50,536 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:02:50,539 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:02:50,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:02:51,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:02:51,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:51,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:51,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:02:51,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-03-04 01:02:51,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:51,094 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:02:51,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455346673] [2025-03-04 01:02:51,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455346673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:51,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:51,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:02:51,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109324315] [2025-03-04 01:02:51,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:51,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:02:51,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:02:51,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:02:51,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:02:51,121 INFO L87 Difference]: Start difference. First operand has 143 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 125 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:02:51,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:51,142 INFO L93 Difference]: Finished difference Result 280 states and 435 transitions. [2025-03-04 01:02:51,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:02:51,144 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2025-03-04 01:02:51,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:51,149 INFO L225 Difference]: With dead ends: 280 [2025-03-04 01:02:51,149 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 01:02:51,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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:02:51,154 INFO L435 NwaCegarLoop]: 207 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, 207 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:02:51,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:02:51,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 01:02:51,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-03-04 01:02:51,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:02:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 207 transitions. [2025-03-04 01:02:51,196 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 207 transitions. Word has length 141 [2025-03-04 01:02:51,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:51,197 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 207 transitions. [2025-03-04 01:02:51,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:02:51,197 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 207 transitions. [2025-03-04 01:02:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 01:02:51,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:51,199 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:51,212 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:02:51,402 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:02:51,403 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:51,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:51,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1745830744, now seen corresponding path program 1 times [2025-03-04 01:02:51,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:02:51,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347094509] [2025-03-04 01:02:51,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:51,405 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:02:51,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:02:51,410 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:02:51,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:02:51,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 01:02:51,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 01:02:51,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:51,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:51,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:02:51,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:51,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:51,924 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:02:51,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347094509] [2025-03-04 01:02:51,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347094509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:51,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:51,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:02:51,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863292386] [2025-03-04 01:02:51,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:51,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:02:51,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:02:51,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:02:51,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:02:51,927 INFO L87 Difference]: Start difference. First operand 140 states and 207 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:52,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:52,150 INFO L93 Difference]: Finished difference Result 279 states and 414 transitions. [2025-03-04 01:02:52,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:02:52,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2025-03-04 01:02:52,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:52,154 INFO L225 Difference]: With dead ends: 279 [2025-03-04 01:02:52,156 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 01:02:52,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 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:02:52,157 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:52,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:02:52,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 01:02:52,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-04 01:02:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 124 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:02:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2025-03-04 01:02:52,167 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 141 [2025-03-04 01:02:52,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:52,168 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2025-03-04 01:02:52,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2025-03-04 01:02:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:02:52,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:52,169 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:52,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:02:52,370 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:02:52,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:52,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:52,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1825967066, now seen corresponding path program 1 times [2025-03-04 01:02:52,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:02:52,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292500901] [2025-03-04 01:02:52,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:52,372 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:02:52,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:02:52,374 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:02:52,375 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:02:52,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:02:52,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:02:52,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:52,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:52,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:02:52,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-03-04 01:02:53,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:02:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:53,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:02:53,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292500901] [2025-03-04 01:02:53,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292500901] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:53,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:02:53,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-04 01:02:53,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054605307] [2025-03-04 01:02:53,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:53,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:02:53,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:02:53,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:02:53,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:02:53,565 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:54,239 INFO L93 Difference]: Finished difference Result 351 states and 514 transitions. [2025-03-04 01:02:54,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:02:54,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2025-03-04 01:02:54,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:54,241 INFO L225 Difference]: With dead ends: 351 [2025-03-04 01:02:54,241 INFO L226 Difference]: Without dead ends: 212 [2025-03-04 01:02:54,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:02:54,242 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 184 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:54,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 580 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:02:54,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-04 01:02:54,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2025-03-04 01:02:54,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 188 states have (on average 1.4308510638297873) internal successors, (269), 189 states have internal predecessors, (269), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:02:54,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 305 transitions. [2025-03-04 01:02:54,253 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 305 transitions. Word has length 143 [2025-03-04 01:02:54,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:54,253 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 305 transitions. [2025-03-04 01:02:54,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:54,254 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 305 transitions. [2025-03-04 01:02:54,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:02:54,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:54,255 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:54,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:02:54,455 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:02:54,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:54,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:54,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1071728230, now seen corresponding path program 1 times [2025-03-04 01:02:54,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:02:54,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172781168] [2025-03-04 01:02:54,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:54,457 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:02:54,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:02:54,459 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:02:54,460 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:02:54,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:02:54,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:02:54,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:54,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:54,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:02:54,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:54,998 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 21 treesize of output 9 [2025-03-04 01:02:55,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-04 01:02:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:02:55,336 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:55,336 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:02:55,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172781168] [2025-03-04 01:02:55,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172781168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:55,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:55,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:02:55,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491592204] [2025-03-04 01:02:55,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:55,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:02:55,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:02:55,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:02:55,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:02:55,337 INFO L87 Difference]: Start difference. First operand 209 states and 305 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:56,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:56,734 INFO L93 Difference]: Finished difference Result 830 states and 1214 transitions. [2025-03-04 01:02:56,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:02:56,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2025-03-04 01:02:56,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:56,739 INFO L225 Difference]: With dead ends: 830 [2025-03-04 01:02:56,739 INFO L226 Difference]: Without dead ends: 624 [2025-03-04 01:02:56,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:02:56,740 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 625 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:56,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1302 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:02:56,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-04 01:02:56,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 562. [2025-03-04 01:02:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 503 states have (on average 1.4274353876739563) internal successors, (718), 506 states have internal predecessors, (718), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:02:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 822 transitions. [2025-03-04 01:02:56,787 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 822 transitions. Word has length 143 [2025-03-04 01:02:56,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:56,787 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 822 transitions. [2025-03-04 01:02:56,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:02:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 822 transitions. [2025-03-04 01:02:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 01:02:56,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:56,789 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:56,807 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:02:56,989 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:02:56,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:56,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:56,990 INFO L85 PathProgramCache]: Analyzing trace with hash -735726233, now seen corresponding path program 1 times [2025-03-04 01:02:56,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:02:56,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636980205] [2025-03-04 01:02:56,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:56,991 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:02:56,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:02:56,993 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:02:56,995 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:02:57,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 01:02:57,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 01:02:57,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:57,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:57,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:02:57,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:57,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:02:57,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2025-03-04 01:02:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-04 01:02:57,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:57,627 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:02:57,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636980205] [2025-03-04 01:02:57,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636980205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:57,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:57,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:02:57,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474818199] [2025-03-04 01:02:57,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:57,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:02:57,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:02:57,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:02:57,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:02:57,628 INFO L87 Difference]: Start difference. First operand 562 states and 822 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:03:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:01,036 INFO L93 Difference]: Finished difference Result 1105 states and 1619 transitions. [2025-03-04 01:03:01,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:03:01,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2025-03-04 01:03:01,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:01,041 INFO L225 Difference]: With dead ends: 1105 [2025-03-04 01:03:01,041 INFO L226 Difference]: Without dead ends: 565 [2025-03-04 01:03:01,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 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:03:01,044 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 187 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:01,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 530 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-04 01:03:01,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-04 01:03:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 562. [2025-03-04 01:03:01,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 503 states have (on average 1.4214711729622267) internal successors, (715), 506 states have internal predecessors, (715), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:03:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 819 transitions. [2025-03-04 01:03:01,071 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 819 transitions. Word has length 143 [2025-03-04 01:03:01,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:01,071 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 819 transitions. [2025-03-04 01:03:01,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:03:01,072 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 819 transitions. [2025-03-04 01:03:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 01:03:01,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:01,075 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:01,097 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:03:01,275 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:03:01,276 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:01,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash -2000218615, now seen corresponding path program 1 times [2025-03-04 01:03:01,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:01,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919256263] [2025-03-04 01:03:01,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:01,278 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:03:01,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:01,280 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:03:01,283 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:03:01,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:03:01,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:03:01,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:01,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:01,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:03:01,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:01,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:01,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-04 01:03:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-04 01:03:01,903 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:01,903 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:01,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919256263] [2025-03-04 01:03:01,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919256263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:01,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:01,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:03:01,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20312862] [2025-03-04 01:03:01,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:01,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:03:01,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:01,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:03:01,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:03:01,904 INFO L87 Difference]: Start difference. First operand 562 states and 819 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:03:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:05,833 INFO L93 Difference]: Finished difference Result 1098 states and 1603 transitions. [2025-03-04 01:03:05,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:03:05,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2025-03-04 01:03:05,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:05,838 INFO L225 Difference]: With dead ends: 1098 [2025-03-04 01:03:05,838 INFO L226 Difference]: Without dead ends: 565 [2025-03-04 01:03:05,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 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:03:05,841 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 178 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:05,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 526 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-04 01:03:05,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-04 01:03:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 562. [2025-03-04 01:03:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 503 states have (on average 1.415506958250497) internal successors, (712), 506 states have internal predecessors, (712), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:03:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 816 transitions. [2025-03-04 01:03:05,867 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 816 transitions. Word has length 145 [2025-03-04 01:03:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:05,868 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 816 transitions. [2025-03-04 01:03:05,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:03:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 816 transitions. [2025-03-04 01:03:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:03:05,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:05,869 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:05,886 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:03:06,069 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:03:06,070 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:06,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:06,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1832081945, now seen corresponding path program 1 times [2025-03-04 01:03:06,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:06,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098412160] [2025-03-04 01:03:06,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:06,071 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:03:06,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:06,073 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:03:06,074 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:03:06,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:03:06,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:03:06,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:06,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:06,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:03:06,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:06,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:06,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-04 01:03:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-03-04 01:03:06,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:06,687 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:06,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098412160] [2025-03-04 01:03:06,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098412160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:06,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:06,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:03:06,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228534387] [2025-03-04 01:03:06,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:06,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:03:06,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:06,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:03:06,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:03:06,689 INFO L87 Difference]: Start difference. First operand 562 states and 816 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:03:10,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:10,770 INFO L93 Difference]: Finished difference Result 1091 states and 1587 transitions. [2025-03-04 01:03:10,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:03:10,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2025-03-04 01:03:10,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:10,773 INFO L225 Difference]: With dead ends: 1091 [2025-03-04 01:03:10,773 INFO L226 Difference]: Without dead ends: 565 [2025-03-04 01:03:10,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 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:03:10,776 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 169 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:10,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 522 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-04 01:03:10,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-04 01:03:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 562. [2025-03-04 01:03:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 503 states have (on average 1.4095427435387673) internal successors, (709), 506 states have internal predecessors, (709), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:03:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 813 transitions. [2025-03-04 01:03:10,801 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 813 transitions. Word has length 147 [2025-03-04 01:03:10,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:10,802 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 813 transitions. [2025-03-04 01:03:10,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 01:03:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 813 transitions. [2025-03-04 01:03:10,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 01:03:10,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:10,803 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:10,821 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:03:11,004 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:03:11,004 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:11,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:11,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1737974582, now seen corresponding path program 1 times [2025-03-04 01:03:11,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:11,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141571106] [2025-03-04 01:03:11,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:11,005 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:03:11,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:11,007 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:03:11,008 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:03:11,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:03:11,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:03:11,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:11,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:11,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:03:11,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-04 01:03:11,520 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:11,520 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:11,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141571106] [2025-03-04 01:03:11,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141571106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:11,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:11,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:03:11,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22230692] [2025-03-04 01:03:11,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:11,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:03:11,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:11,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:03:11,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:03:11,521 INFO L87 Difference]: Start difference. First operand 562 states and 813 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:03:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:11,693 INFO L93 Difference]: Finished difference Result 1105 states and 1598 transitions. [2025-03-04 01:03:11,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:03:11,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 149 [2025-03-04 01:03:11,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:11,697 INFO L225 Difference]: With dead ends: 1105 [2025-03-04 01:03:11,697 INFO L226 Difference]: Without dead ends: 574 [2025-03-04 01:03:11,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:03:11,698 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 1 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:11,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 881 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:03:11,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-04 01:03:11,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 562. [2025-03-04 01:03:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 503 states have (on average 1.4035785288270377) internal successors, (706), 506 states have internal predecessors, (706), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:03:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 810 transitions. [2025-03-04 01:03:11,716 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 810 transitions. Word has length 149 [2025-03-04 01:03:11,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:11,716 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 810 transitions. [2025-03-04 01:03:11,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-04 01:03:11,717 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 810 transitions. [2025-03-04 01:03:11,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 01:03:11,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:11,718 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:11,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 (9)] Ended with exit code 0 [2025-03-04 01:03:11,918 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:03:11,919 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:11,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:11,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1881300105, now seen corresponding path program 1 times [2025-03-04 01:03:11,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:11,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777360479] [2025-03-04 01:03:11,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:11,920 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:03:11,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:11,921 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:03:11,922 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:03:12,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:03:12,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:03:12,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:12,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:12,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:03:12,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:12,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-03-04 01:03:12,445 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 108 treesize of output 90 [2025-03-04 01:03:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-04 01:03:12,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:12,470 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:12,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777360479] [2025-03-04 01:03:12,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777360479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:12,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:12,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:03:12,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321041455] [2025-03-04 01:03:12,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:12,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:03:12,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:12,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:03:12,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:03:12,471 INFO L87 Difference]: Start difference. First operand 562 states and 810 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:03:13,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:13,331 INFO L93 Difference]: Finished difference Result 1556 states and 2250 transitions. [2025-03-04 01:03:13,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:03:13,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 149 [2025-03-04 01:03:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:13,337 INFO L225 Difference]: With dead ends: 1556 [2025-03-04 01:03:13,337 INFO L226 Difference]: Without dead ends: 1068 [2025-03-04 01:03:13,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:03:13,338 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 189 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:13,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1403 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:03:13,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2025-03-04 01:03:13,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1066. [2025-03-04 01:03:13,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 967 states have (on average 1.4053774560496382) internal successors, (1359), 972 states have internal predecessors, (1359), 88 states have call successors, (88), 10 states have call predecessors, (88), 10 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-04 01:03:13,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1535 transitions. [2025-03-04 01:03:13,381 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1535 transitions. Word has length 149 [2025-03-04 01:03:13,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:13,381 INFO L471 AbstractCegarLoop]: Abstraction has 1066 states and 1535 transitions. [2025-03-04 01:03:13,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 01:03:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1535 transitions. [2025-03-04 01:03:13,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:03:13,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:13,383 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:13,401 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:03:13,584 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:03:13,584 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:13,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:13,584 INFO L85 PathProgramCache]: Analyzing trace with hash -93547842, now seen corresponding path program 1 times [2025-03-04 01:03:13,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:13,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102547790] [2025-03-04 01:03:13,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:13,585 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:03:13,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:13,587 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:03:13,587 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:03:13,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes.