./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.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-81.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 22fa4060294a09539330d4735cc6009dbd85eb0b342c0594bbbbd9284eb3fd3c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:10:32,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:10:32,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:10:32,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:10:32,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:10:32,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:10:32,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:10:32,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:10:32,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:10:32,574 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:10:32,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:10:32,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:10:32,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:10:32,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:10:32,575 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:10:32,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:10:32,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:10:32,576 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:10:32,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:10:32,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:10:32,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:10:32,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:10:32,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:10:32,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:10:32,576 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:10:32,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:10:32,577 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:10:32,577 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:10:32,577 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:10:32,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:10:32,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:10:32,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:10:32,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:10:32,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:10:32,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:10:32,578 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:10:32,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:10:32,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:10:32,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:10:32,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:10:32,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:10:32,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:10:32,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:10:32,578 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 -> 22fa4060294a09539330d4735cc6009dbd85eb0b342c0594bbbbd9284eb3fd3c [2025-03-04 01:10:32,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:10:32,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:10:32,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:10:32,806 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:10:32,806 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:10:32,808 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-81.i [2025-03-04 01:10:33,937 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1451434a0/89babea4d39a4eb98c33953521315e33/FLAG38a6cad4a [2025-03-04 01:10:34,143 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:10:34,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.i [2025-03-04 01:10:34,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1451434a0/89babea4d39a4eb98c33953521315e33/FLAG38a6cad4a [2025-03-04 01:10:34,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1451434a0/89babea4d39a4eb98c33953521315e33 [2025-03-04 01:10:34,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:10:34,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:10:34,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:10:34,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:10:34,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:10:34,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:10:34" (1/1) ... [2025-03-04 01:10:34,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314cac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:34, skipping insertion in model container [2025-03-04 01:10:34,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:10:34" (1/1) ... [2025-03-04 01:10:34,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:10:34,286 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-81.i[916,929] [2025-03-04 01:10:34,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:10:34,352 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:10:34,361 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-81.i[916,929] [2025-03-04 01:10:34,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:10:34,438 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:10:34,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:34 WrapperNode [2025-03-04 01:10:34,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:10:34,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:10:34,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:10:34,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:10:34,451 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:10:34" (1/1) ... [2025-03-04 01:10:34,469 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:10:34" (1/1) ... [2025-03-04 01:10:34,514 INFO L138 Inliner]: procedures = 29, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 551 [2025-03-04 01:10:34,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:10:34,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:10:34,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:10:34,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:10:34,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:34" (1/1) ... [2025-03-04 01:10:34,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:34" (1/1) ... [2025-03-04 01:10:34,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:34" (1/1) ... [2025-03-04 01:10:34,566 INFO L175 MemorySlicer]: Split 142 memory accesses to 6 slices as follows [2, 14, 49, 31, 8, 38]. 35 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 2, 5, 3, 1, 4]. The 19 writes are split as follows [0, 2, 5, 4, 3, 5]. [2025-03-04 01:10:34,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:34" (1/1) ... [2025-03-04 01:10:34,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:34" (1/1) ... [2025-03-04 01:10:34,582 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:34" (1/1) ... [2025-03-04 01:10:34,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:34" (1/1) ... [2025-03-04 01:10:34,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:34" (1/1) ... [2025-03-04 01:10:34,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:34" (1/1) ... [2025-03-04 01:10:34,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:10:34,598 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:10:34,598 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:10:34,598 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:10:34,601 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:34" (1/1) ... [2025-03-04 01:10:34,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:10:34,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:10:34,631 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:10:34,638 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:10:34,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:10:34,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:10:34,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:10:34,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:10:34,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:10:34,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:10:34,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:10:34,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:10:34,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:10:34,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:10:34,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:10:34,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:10:34,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:10:34,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:10:34,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:10:34,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:10:34,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:10:34,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:10:34,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:10:34,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:10:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:10:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:10:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:10:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:10:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:10:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:10:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:10:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:10:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:10:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:10:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:10:34,657 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:10:34,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:10:34,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:10:34,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:10:34,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:10:34,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:10:34,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:10:34,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:10:34,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:10:34,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:10:34,784 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:10:34,786 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:10:35,268 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem98#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite107#1;havoc property_#t~mem103#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~bitwise110#1;havoc property_#t~ite122#1;havoc property_#t~mem111#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem121#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~short127#1;havoc property_#t~ite135#1;havoc property_#t~mem131#1;havoc property_#t~mem128#1;havoc property_#t~ite130#1;havoc property_#t~mem129#1;havoc property_#t~mem134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short136#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~ite152#1;havoc property_#t~mem141#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~ite149#1;havoc property_#t~mem146#1;havoc property_#t~mem142#1;havoc property_#t~ite145#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~mem148#1;havoc property_#t~mem147#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~short153#1; [2025-03-04 01:10:35,315 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2025-03-04 01:10:35,316 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:10:35,335 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:10:35,337 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:10:35,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:10:35 BoogieIcfgContainer [2025-03-04 01:10:35,338 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:10:35,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:10:35,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:10:35,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:10:35,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:10:34" (1/3) ... [2025-03-04 01:10:35,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74248284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:10:35, skipping insertion in model container [2025-03-04 01:10:35,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:34" (2/3) ... [2025-03-04 01:10:35,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74248284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:10:35, skipping insertion in model container [2025-03-04 01:10:35,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:10:35" (3/3) ... [2025-03-04 01:10:35,347 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-81.i [2025-03-04 01:10:35,360 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:10:35,363 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-81.i that has 2 procedures, 128 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:10:35,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:10:35,429 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;@3459edb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:10:35,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:10:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 107 states have (on average 1.439252336448598) internal successors, (154), 108 states have internal predecessors, (154), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:10:35,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:10:35,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:35,446 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:35,447 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:35,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:35,451 INFO L85 PathProgramCache]: Analyzing trace with hash -885865617, now seen corresponding path program 1 times [2025-03-04 01:10:35,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:35,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022520023] [2025-03-04 01:10:35,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:35,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:35,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:10:35,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:10:35,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:35,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 01:10:35,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:35,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022520023] [2025-03-04 01:10:35,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022520023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:10:35,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662373579] [2025-03-04 01:10:35,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:35,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:35,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:10:35,744 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:10:35,748 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:10:35,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:10:35,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:10:35,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:35,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:35,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:10:35,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:36,004 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 01:10:36,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:36,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662373579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:36,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:10:36,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:10:36,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895931497] [2025-03-04 01:10:36,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:36,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:10:36,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:36,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:10:36,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:10:36,026 INFO L87 Difference]: Start difference. First operand has 128 states, 107 states have (on average 1.439252336448598) internal successors, (154), 108 states have internal predecessors, (154), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:10:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:36,059 INFO L93 Difference]: Finished difference Result 250 states and 393 transitions. [2025-03-04 01:10:36,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:10:36,062 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2025-03-04 01:10:36,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:36,067 INFO L225 Difference]: With dead ends: 250 [2025-03-04 01:10:36,069 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 01:10:36,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:10:36,074 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:36,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:36,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 01:10:36,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-04 01:10:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:10:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2025-03-04 01:10:36,122 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 183 transitions. Word has length 148 [2025-03-04 01:10:36,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:36,123 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 183 transitions. [2025-03-04 01:10:36,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:10:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 183 transitions. [2025-03-04 01:10:36,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:10:36,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:36,129 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:36,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:10:36,330 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:10:36,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:36,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:36,333 INFO L85 PathProgramCache]: Analyzing trace with hash -120060419, now seen corresponding path program 1 times [2025-03-04 01:10:36,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:36,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289543554] [2025-03-04 01:10:36,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:36,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:10:36,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:10:36,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:36,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:10:36,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:36,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289543554] [2025-03-04 01:10:36,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289543554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:36,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:36,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:10:36,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271417009] [2025-03-04 01:10:36,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:36,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:10:36,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:36,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:10:36,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:36,715 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:10:36,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:36,791 INFO L93 Difference]: Finished difference Result 328 states and 484 transitions. [2025-03-04 01:10:36,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:10:36,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2025-03-04 01:10:36,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:36,793 INFO L225 Difference]: With dead ends: 328 [2025-03-04 01:10:36,793 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 01:10:36,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:36,795 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 114 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:36,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 344 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:36,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 01:10:36,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 191. [2025-03-04 01:10:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 152 states have (on average 1.361842105263158) internal successors, (207), 152 states have internal predecessors, (207), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:10:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 279 transitions. [2025-03-04 01:10:36,822 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 279 transitions. Word has length 148 [2025-03-04 01:10:36,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:36,823 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 279 transitions. [2025-03-04 01:10:36,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:10:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 279 transitions. [2025-03-04 01:10:36,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 01:10:36,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:36,825 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:36,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:10:36,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:36,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:36,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2039986778, now seen corresponding path program 1 times [2025-03-04 01:10:36,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:36,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407020408] [2025-03-04 01:10:36,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:36,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:36,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:10:36,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:10:36,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:36,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-04 01:10:37,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:37,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407020408] [2025-03-04 01:10:37,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407020408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:10:37,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972699658] [2025-03-04 01:10:37,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:37,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:10:37,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:10:37,100 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:10:37,101 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:10:37,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:10:37,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:10:37,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:37,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:37,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:10:37,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:37,339 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:10:37,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:37,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972699658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:37,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:10:37,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:10:37,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062298274] [2025-03-04 01:10:37,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:37,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:10:37,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:37,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:10:37,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:10:37,340 INFO L87 Difference]: Start difference. First operand 191 states and 279 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:10:37,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:37,377 INFO L93 Difference]: Finished difference Result 315 states and 462 transitions. [2025-03-04 01:10:37,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:10:37,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-03-04 01:10:37,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:37,379 INFO L225 Difference]: With dead ends: 315 [2025-03-04 01:10:37,379 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 01:10:37,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 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:10:37,380 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:37,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 526 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:37,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 01:10:37,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-03-04 01:10:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:10:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 281 transitions. [2025-03-04 01:10:37,401 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 281 transitions. Word has length 149 [2025-03-04 01:10:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:37,401 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 281 transitions. [2025-03-04 01:10:37,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:10:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 281 transitions. [2025-03-04 01:10:37,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:10:37,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:37,405 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:37,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:10:37,606 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,SelfDestructingSolverStorable2 [2025-03-04 01:10:37,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:37,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:37,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1426054340, now seen corresponding path program 1 times [2025-03-04 01:10:37,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:37,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991978292] [2025-03-04 01:10:37,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:37,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:37,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:10:37,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:10:37,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:37,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:37,825 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:10:37,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:37,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991978292] [2025-03-04 01:10:37,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991978292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:37,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:37,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:10:37,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900003298] [2025-03-04 01:10:37,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:37,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:10:37,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:37,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:10:37,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:37,827 INFO L87 Difference]: Start difference. First operand 193 states and 281 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:10:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:37,993 INFO L93 Difference]: Finished difference Result 376 states and 548 transitions. [2025-03-04 01:10:37,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:10:37,993 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2025-03-04 01:10:37,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:37,995 INFO L225 Difference]: With dead ends: 376 [2025-03-04 01:10:37,995 INFO L226 Difference]: Without dead ends: 252 [2025-03-04 01:10:37,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:10:37,996 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 178 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:37,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 481 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:10:38,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-04 01:10:38,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 222. [2025-03-04 01:10:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 183 states have (on average 1.3715846994535519) internal successors, (251), 183 states have internal predecessors, (251), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:10:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 323 transitions. [2025-03-04 01:10:38,021 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 323 transitions. Word has length 151 [2025-03-04 01:10:38,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:38,022 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 323 transitions. [2025-03-04 01:10:38,022 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:10:38,022 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 323 transitions. [2025-03-04 01:10:38,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:10:38,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:38,024 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:38,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:10:38,024 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:38,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:38,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1787023348, now seen corresponding path program 1 times [2025-03-04 01:10:38,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:38,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135982085] [2025-03-04 01:10:38,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:38,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:38,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:10:38,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:10:38,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:38,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:10:38,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:38,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135982085] [2025-03-04 01:10:38,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135982085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:38,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:38,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:10:38,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032497884] [2025-03-04 01:10:38,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:38,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:10:38,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:38,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:10:38,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:38,577 INFO L87 Difference]: Start difference. First operand 222 states and 323 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:10:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:38,685 INFO L93 Difference]: Finished difference Result 447 states and 644 transitions. [2025-03-04 01:10:38,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:10:38,686 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 153 [2025-03-04 01:10:38,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:38,688 INFO L225 Difference]: With dead ends: 447 [2025-03-04 01:10:38,689 INFO L226 Difference]: Without dead ends: 313 [2025-03-04 01:10:38,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:10:38,690 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 79 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:38,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1022 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:10:38,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-04 01:10:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2025-03-04 01:10:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 267 states have (on average 1.3782771535580525) internal successors, (368), 268 states have internal predecessors, (368), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:10:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 444 transitions. [2025-03-04 01:10:38,709 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 444 transitions. Word has length 153 [2025-03-04 01:10:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:38,710 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 444 transitions. [2025-03-04 01:10:38,711 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:10:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 444 transitions. [2025-03-04 01:10:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:10:38,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:38,713 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:38,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:10:38,713 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:38,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:38,714 INFO L85 PathProgramCache]: Analyzing trace with hash 469887659, now seen corresponding path program 1 times [2025-03-04 01:10:38,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:38,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849240341] [2025-03-04 01:10:38,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:38,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:38,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:10:38,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:10:38,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:38,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:10:39,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:39,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849240341] [2025-03-04 01:10:39,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849240341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:39,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:39,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:10:39,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598951671] [2025-03-04 01:10:39,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:39,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:10:39,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:39,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:10:39,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:39,129 INFO L87 Difference]: Start difference. First operand 310 states and 444 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:10:39,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:39,234 INFO L93 Difference]: Finished difference Result 579 states and 829 transitions. [2025-03-04 01:10:39,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:10:39,234 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 153 [2025-03-04 01:10:39,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:39,238 INFO L225 Difference]: With dead ends: 579 [2025-03-04 01:10:39,238 INFO L226 Difference]: Without dead ends: 389 [2025-03-04 01:10:39,239 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:10:39,239 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 71 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:39,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 996 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:10:39,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-04 01:10:39,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 342. [2025-03-04 01:10:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 299 states have (on average 1.3846153846153846) internal successors, (414), 300 states have internal predecessors, (414), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:10:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 490 transitions. [2025-03-04 01:10:39,260 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 490 transitions. Word has length 153 [2025-03-04 01:10:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:39,260 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 490 transitions. [2025-03-04 01:10:39,260 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:10:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 490 transitions. [2025-03-04 01:10:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 01:10:39,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:39,263 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:39,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:10:39,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:39,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:39,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1676849203, now seen corresponding path program 1 times [2025-03-04 01:10:39,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:39,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228313543] [2025-03-04 01:10:39,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:39,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:39,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 01:10:39,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 01:10:39,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:39,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:10:39,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:10:39,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228313543] [2025-03-04 01:10:39,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228313543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:39,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:39,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:10:39,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525445969] [2025-03-04 01:10:39,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:39,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:10:39,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:10:39,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:10:39,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:39,673 INFO L87 Difference]: Start difference. First operand 342 states and 490 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:10:39,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:39,764 INFO L93 Difference]: Finished difference Result 647 states and 920 transitions. [2025-03-04 01:10:39,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:10:39,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 154 [2025-03-04 01:10:39,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:39,767 INFO L225 Difference]: With dead ends: 647 [2025-03-04 01:10:39,767 INFO L226 Difference]: Without dead ends: 441 [2025-03-04 01:10:39,767 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:10:39,768 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 110 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:39,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 776 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:10:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-04 01:10:39,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 342. [2025-03-04 01:10:39,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 299 states have (on average 1.3846153846153846) internal successors, (414), 300 states have internal predecessors, (414), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:10:39,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 490 transitions. [2025-03-04 01:10:39,785 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 490 transitions. Word has length 154 [2025-03-04 01:10:39,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:39,785 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 490 transitions. [2025-03-04 01:10:39,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:10:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 490 transitions. [2025-03-04 01:10:39,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:10:39,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:39,787 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:39,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:10:39,788 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:39,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1336794454, now seen corresponding path program 1 times [2025-03-04 01:10:39,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:10:39,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779310368] [2025-03-04 01:10:39,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:39,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:10:39,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:10:39,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:10:39,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:39,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:10:39,866 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:10:39,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:10:39,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:10:39,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:39,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:10:40,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:10:40,008 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:10:40,009 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:10:40,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:10:40,013 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:40,108 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:10:40,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:10:40 BoogieIcfgContainer [2025-03-04 01:10:40,113 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:10:40,113 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:10:40,113 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:10:40,114 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:10:40,114 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:10:35" (3/4) ... [2025-03-04 01:10:40,116 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:10:40,116 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:10:40,117 INFO L158 Benchmark]: Toolchain (without parser) took 5953.61ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 111.7MB in the beginning and 168.7MB in the end (delta: -57.0MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2025-03-04 01:10:40,117 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:10:40,118 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.62ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 96.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:10:40,118 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.74ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 91.6MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:10:40,118 INFO L158 Benchmark]: Boogie Preprocessor took 77.99ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 87.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:10:40,118 INFO L158 Benchmark]: IcfgBuilder took 740.28ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 49.3MB in the end (delta: 37.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:10:40,119 INFO L158 Benchmark]: TraceAbstraction took 4773.26ms. 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 168.8MB in the end (delta: -119.9MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. [2025-03-04 01:10:40,119 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 218.1MB. Free memory was 168.8MB in the beginning and 168.7MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:10:40,120 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.20ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.62ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 96.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.74ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 91.6MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 77.99ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 87.2MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 740.28ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 49.3MB in the end (delta: 37.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4773.26ms. 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 168.8MB in the end (delta: -119.9MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 218.1MB. Free memory was 168.8MB in the beginning and 168.7MB 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 bitwiseOr at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L25-L27] double double_Array_0[5] = { 999999999999.3, 0.0, 2.5, 4.5, 9999.5 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, -128, 16 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, -128, 16 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, -128, 16 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, -128, 16 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -8 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -8 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][2] = { {5, 128}, {32647, 16} }; [L37] signed long int last_1_signed_long_int_Array_0_0_ = -8; [L38] unsigned short int last_1_unsigned_short_int_Array_0_0__0_ = 5; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L102] EXPR signed_long_int_Array_0[0] [L102] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L103] EXPR unsigned_short_int_Array_0[0][0] [L103] last_1_unsigned_short_int_Array_0_0__0_ = unsigned_short_int_Array_0[0][0] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L71] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] double_Array_0[0] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[0] [L78] 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L78] EXPR double_Array_0[0] [L78] 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] double_Array_0[1] = __VERIFIER_nondet_double() [L80] EXPR double_Array_0[1] [L80] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F [L80] EXPR double_Array_0[1] [L80] EXPR double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR (double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR (double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not((double_Array_0[1] >= 4611686.018427382800e+12F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] double_Array_0[2] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[2] [L82] 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L82] EXPR double_Array_0[2] [L82] 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}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] double_Array_0[3] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[3] [L84] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F [L84] EXPR double_Array_0[3] [L84] EXPR double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR (double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR (double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not((double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not((double_Array_0[3] >= -922337.2036854765600e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L88] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L92] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L94] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L95] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L97] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L98] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L114] RET updateVariables() [L115] CALL step() [L42] signed long int stepLocal_0 = (((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_)); VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-25, unsigned_short_int_Array_0={8:0}] [L43] EXPR last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_ VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-25, unsigned_short_int_Array_0={8:0}] [L43] COND TRUE stepLocal_0 != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_) [L44] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] COND TRUE BOOL_unsigned_char_Array_0[1] [L45] EXPR signed_char_Array_0[2] [L45] EXPR signed_char_Array_0[0] [L45] signed_char_Array_0[1] = (signed_char_Array_0[2] + signed_char_Array_0[0]) [L50] EXPR signed_char_Array_0[2] [L50] EXPR signed_char_Array_0[1] [L50] unsigned char stepLocal_1 = signed_char_Array_0[2] >= signed_char_Array_0[1]; [L51] stepLocal_1 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] stepLocal_1 && BOOL_unsigned_char_Array_0[0] [L51] EXPR BOOL_unsigned_char_Array_0[0] [L51] stepLocal_1 && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] COND FALSE !(stepLocal_1 && BOOL_unsigned_char_Array_0[0]) [L54] EXPR unsigned_short_int_Array_0[1][0] [L54] EXPR unsigned_short_int_Array_0[0][1] [L54] unsigned_short_int_Array_0[0][0] = ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1]) [L56] EXPR signed_char_Array_0[1] [L56] signed char stepLocal_2 = signed_char_Array_0[1]; [L57] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND FALSE !(stepLocal_2 > unsigned_short_int_Array_0[1][0]) [L64] EXPR unsigned_short_int_Array_0[1][1] [L64] signed_long_int_Array_0[0] = unsigned_short_int_Array_0[1][1] [L66] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] COND TRUE BOOL_unsigned_char_Array_0[1] [L67] EXPR double_Array_0[3] [L67] EXPR double_Array_0[2] [L67] EXPR double_Array_0[1] [L67] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR ((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))) [L67] EXPR double_Array_0[3] [L67] EXPR ((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] double_Array_0[4] = ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1 [L106] EXPR double_Array_0[4] [L106] EXPR double_Array_0[3] [L106] EXPR double_Array_0[2] [L106] EXPR double_Array_0[1] [L106] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR ((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))) [L106] EXPR double_Array_0[3] [L106] EXPR ((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR (BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR ((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR ((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1]))))) && ((signed_char_Array_0[1] > unsigned_short_int_Array_0[1][0]) ? ((double_Array_0[3] < (double_Array_0[1] - double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) ((((unsigned_short_int_Array_0[1][1]) < 0 ) ? -(unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[1][1]))))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106] EXPR (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1]))))) && ((signed_char_Array_0[1] > unsigned_short_int_Array_0[1][0]) ? ((double_Array_0[3] < (double_Array_0[1] - double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) ((((unsigned_short_int_Array_0[1][1]) < 0 ) ? -(unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[1][1]))))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L106-L107] return (((BOOL_unsigned_char_Array_0[1] ? (double_Array_0[4] == ((double) ((((double_Array_0[3]) > ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0])))) ? (double_Array_0[3]) : ((double_Array_0[2] - (double_Array_0[1] - double_Array_0[0]))))))) : 1) && ((((((-25) < (last_1_signed_long_int_Array_0_0_)) ? (-25) : (last_1_signed_long_int_Array_0_0_))) != (last_1_signed_long_int_Array_0_0_ ^ last_1_unsigned_short_int_Array_0_0__0_)) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[0]))) : 1) : (signed_char_Array_0[1] == ((signed char) ((((signed_char_Array_0[0]) < (signed_char_Array_0[2])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[2]))))))) && (((signed_char_Array_0[2] >= signed_char_Array_0[1]) && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1][1]) < (100)) ? (unsigned_short_int_Array_0[1][1]) : (100))))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) ((unsigned_short_int_Array_0[1][0] - 5) + unsigned_short_int_Array_0[0][1]))))) && ((signed_char_Array_0[1] > unsigned_short_int_Array_0[1][0]) ? ((double_Array_0[3] < (double_Array_0[1] - double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) ((((unsigned_short_int_Array_0[1][1]) < 0 ) ? -(unsigned_short_int_Array_0[1][1]) : (unsigned_short_int_Array_0[1][1]))))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) unsigned_short_int_Array_0[1][1]))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, last_1_unsigned_short_int_Array_0_0__0_=5, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 8, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 555 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 552 mSDsluCounter, 4326 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2967 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 367 IncrementalHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 1359 mSDtfsCounter, 367 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=6, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 194 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1508 NumberOfCodeBlocks, 1508 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1344 ConstructedInterpolants, 0 QuantifiedInterpolants, 2559 SizeOfPredicates, 0 NumberOfNonLiveVariables, 983 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 5423/5508 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:10:40,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.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 22fa4060294a09539330d4735cc6009dbd85eb0b342c0594bbbbd9284eb3fd3c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:10:42,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:10:42,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:10:42,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:10:42,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:10:42,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:10:42,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:10:42,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:10:42,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:10:42,192 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:10:42,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:10:42,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:10:42,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:10:42,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:10:42,194 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:10:42,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:10:42,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:10:42,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:10:42,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:10:42,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:10:42,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:10:42,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:10:42,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:10:42,195 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:10:42,195 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:10:42,195 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:10:42,195 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:10:42,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:10:42,195 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:10:42,195 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:10:42,196 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:10:42,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:10:42,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:10:42,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:10:42,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:10:42,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:10:42,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:10:42,197 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:10:42,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:10:42,197 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:10:42,197 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:10:42,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:10:42,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:10:42,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:10:42,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:10:42,197 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 -> 22fa4060294a09539330d4735cc6009dbd85eb0b342c0594bbbbd9284eb3fd3c [2025-03-04 01:10:42,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:10:42,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:10:42,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:10:42,543 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:10:42,543 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:10:42,544 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-81.i [2025-03-04 01:10:43,802 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e74f65e69/503851f6d83f46eeb7bd346ee73e1729/FLAGed209d71c [2025-03-04 01:10:43,978 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:10:43,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-81.i [2025-03-04 01:10:43,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e74f65e69/503851f6d83f46eeb7bd346ee73e1729/FLAGed209d71c [2025-03-04 01:10:44,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e74f65e69/503851f6d83f46eeb7bd346ee73e1729 [2025-03-04 01:10:44,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:10:44,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:10:44,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:10:44,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:10:44,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:10:44,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:10:44" (1/1) ... [2025-03-04 01:10:44,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54fa5e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:44, skipping insertion in model container [2025-03-04 01:10:44,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:10:44" (1/1) ... [2025-03-04 01:10:44,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:10:44,461 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-81.i[916,929] [2025-03-04 01:10:44,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:10:44,536 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:10:44,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-81.i[916,929] [2025-03-04 01:10:44,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:10:44,609 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:10:44,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:44 WrapperNode [2025-03-04 01:10:44,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:10:44,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:10:44,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:10:44,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:10:44,617 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:10:44" (1/1) ... [2025-03-04 01:10:44,634 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:10:44" (1/1) ... [2025-03-04 01:10:44,664 INFO L138 Inliner]: procedures = 36, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 527 [2025-03-04 01:10:44,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:10:44,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:10:44,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:10:44,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:10:44,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:44" (1/1) ... [2025-03-04 01:10:44,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:44" (1/1) ... [2025-03-04 01:10:44,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:44" (1/1) ... [2025-03-04 01:10:44,705 INFO L175 MemorySlicer]: Split 142 memory accesses to 6 slices as follows [2, 14, 49, 31, 8, 38]. 35 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 2, 5, 3, 1, 4]. The 19 writes are split as follows [0, 2, 5, 4, 3, 5]. [2025-03-04 01:10:44,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:44" (1/1) ... [2025-03-04 01:10:44,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:44" (1/1) ... [2025-03-04 01:10:44,737 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:44" (1/1) ... [2025-03-04 01:10:44,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:44" (1/1) ... [2025-03-04 01:10:44,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:44" (1/1) ... [2025-03-04 01:10:44,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:44" (1/1) ... [2025-03-04 01:10:44,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:10:44,756 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:10:44,756 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:10:44,756 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:10:44,757 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:44" (1/1) ... [2025-03-04 01:10:44,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:10:44,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:10:44,782 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:10:44,788 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:10:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:10:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:10:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:10:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-04 01:10:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-04 01:10:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-04 01:10:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-04 01:10:44,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-04 01:10:44,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:10:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:10:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:10:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:10:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:10:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:10:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:10:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:10:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:10:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:10:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:10:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 01:10:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-04 01:10:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-04 01:10:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-04 01:10:44,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:10:44,807 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:10:44,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:10:44,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:10:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:10:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-04 01:10:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-04 01:10:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-04 01:10:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-04 01:10:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:10:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:10:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:10:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:10:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:10:44,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-04 01:10:44,927 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:10:44,928 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:10:54,571 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem97#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite106#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite120#1;havoc property_#t~mem109#1;havoc property_#t~ite113#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem119#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~short125#1;havoc property_#t~ite133#1;havoc property_#t~mem129#1;havoc property_#t~mem126#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~short134#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite150#1;havoc property_#t~mem139#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~ite147#1;havoc property_#t~mem144#1;havoc property_#t~mem140#1;havoc property_#t~ite143#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem146#1;havoc property_#t~mem145#1;havoc property_#t~mem149#1;havoc property_#t~mem148#1;havoc property_#t~short151#1; [2025-03-04 01:10:54,605 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2025-03-04 01:10:54,605 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:10:54,612 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:10:54,612 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:10:54,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:10:54 BoogieIcfgContainer [2025-03-04 01:10:54,613 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:10:54,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:10:54,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:10:54,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:10:54,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:10:44" (1/3) ... [2025-03-04 01:10:54,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acc3c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:10:54, skipping insertion in model container [2025-03-04 01:10:54,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:44" (2/3) ... [2025-03-04 01:10:54,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acc3c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:10:54, skipping insertion in model container [2025-03-04 01:10:54,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:10:54" (3/3) ... [2025-03-04 01:10:54,621 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-81.i [2025-03-04 01:10:54,630 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:10:54,631 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-81.i that has 2 procedures, 120 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:10:54,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:10:54,680 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;@13787f28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:10:54,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:10:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:10:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:10:54,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:54,691 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:54,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:54,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:54,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1576455110, now seen corresponding path program 1 times [2025-03-04 01:10:54,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:54,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936230188] [2025-03-04 01:10:54,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:54,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:54,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:54,705 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:54,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:10:54,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:10:54,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:10:54,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:54,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:55,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:10:55,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-03-04 01:10:55,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:55,042 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:55,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936230188] [2025-03-04 01:10:55,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936230188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:55,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:55,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:10:55,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041835233] [2025-03-04 01:10:55,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:55,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:10:55,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:55,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:10:55,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:10:55,064 INFO L87 Difference]: Start difference. First operand has 120 states, 99 states have (on average 1.4141414141414141) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:10:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:55,082 INFO L93 Difference]: Finished difference Result 234 states and 365 transitions. [2025-03-04 01:10:55,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:10:55,085 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-03-04 01:10:55,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:55,108 INFO L225 Difference]: With dead ends: 234 [2025-03-04 01:10:55,108 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 01:10:55,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:10:55,116 INFO L435 NwaCegarLoop]: 169 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, 169 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:55,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 01:10:55,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-04 01:10:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:10:55,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2025-03-04 01:10:55,160 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 147 [2025-03-04 01:10:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:55,161 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2025-03-04 01:10:55,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:10:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2025-03-04 01:10:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:10:55,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:55,165 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:55,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:10:55,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:55,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:55,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:55,370 INFO L85 PathProgramCache]: Analyzing trace with hash -2139619464, now seen corresponding path program 1 times [2025-03-04 01:10:55,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:55,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231438480] [2025-03-04 01:10:55,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:55,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:55,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:55,376 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:55,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:10:55,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:10:55,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:10:55,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:55,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:55,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:10:55,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:56,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-04 01:10:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-03-04 01:10:56,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:10:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:10:57,382 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:57,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231438480] [2025-03-04 01:10:57,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231438480] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:10:57,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:10:57,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-04 01:10:57,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666495841] [2025-03-04 01:10:57,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:57,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:10:57,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:57,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:10:57,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:10:57,385 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:10:57,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:57,607 INFO L93 Difference]: Finished difference Result 288 states and 413 transitions. [2025-03-04 01:10:57,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:10:57,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-03-04 01:10:57,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:57,611 INFO L225 Difference]: With dead ends: 288 [2025-03-04 01:10:57,611 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 01:10:57,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:10:57,612 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 140 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 558 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:57,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 558 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:10:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 01:10:57,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2025-03-04 01:10:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 148 states have (on average 1.3783783783783783) internal successors, (204), 149 states have internal predecessors, (204), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:10:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 244 transitions. [2025-03-04 01:10:57,629 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 244 transitions. Word has length 147 [2025-03-04 01:10:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:57,630 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 244 transitions. [2025-03-04 01:10:57,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:10:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 244 transitions. [2025-03-04 01:10:57,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 01:10:57,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:57,631 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:57,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:10:57,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:57,832 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:57,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:57,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1746523607, now seen corresponding path program 1 times [2025-03-04 01:10:57,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:57,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901847944] [2025-03-04 01:10:57,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:57,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:57,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:57,835 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:57,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:10:57,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 01:10:58,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 01:10:58,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:58,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:58,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:10:58,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:10:58,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:58,130 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:58,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901847944] [2025-03-04 01:10:58,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901847944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:58,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:58,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:10:58,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595392168] [2025-03-04 01:10:58,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:58,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:10:58,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:58,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:10:58,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:58,131 INFO L87 Difference]: Start difference. First operand 171 states and 244 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:10:58,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:58,192 INFO L93 Difference]: Finished difference Result 343 states and 491 transitions. [2025-03-04 01:10:58,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:10:58,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-03-04 01:10:58,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:58,195 INFO L225 Difference]: With dead ends: 343 [2025-03-04 01:10:58,198 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 01:10:58,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:58,200 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:58,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 490 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:58,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 01:10:58,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-04 01:10:58,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 152 states have (on average 1.368421052631579) internal successors, (208), 153 states have internal predecessors, (208), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:10:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 248 transitions. [2025-03-04 01:10:58,217 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 248 transitions. Word has length 147 [2025-03-04 01:10:58,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:58,217 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 248 transitions. [2025-03-04 01:10:58,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:10:58,217 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 248 transitions. [2025-03-04 01:10:58,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 01:10:58,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:58,219 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:58,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:10:58,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:58,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:58,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:58,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1277109173, now seen corresponding path program 1 times [2025-03-04 01:10:58,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:58,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880518168] [2025-03-04 01:10:58,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:58,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:58,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:58,424 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:58,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:10:58,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:10:58,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:10:58,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:58,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:58,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:10:58,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-03-04 01:10:59,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:10:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:10:59,997 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:59,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880518168] [2025-03-04 01:10:59,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880518168] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:10:59,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:10:59,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-04 01:10:59,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024167632] [2025-03-04 01:10:59,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:59,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:10:59,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:59,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:10:59,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:10:59,998 INFO L87 Difference]: Start difference. First operand 175 states and 248 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:11:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:00,196 INFO L93 Difference]: Finished difference Result 402 states and 567 transitions. [2025-03-04 01:11:00,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:11:00,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-03-04 01:11:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:00,198 INFO L225 Difference]: With dead ends: 402 [2025-03-04 01:11:00,198 INFO L226 Difference]: Without dead ends: 230 [2025-03-04 01:11:00,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:11:00,199 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 124 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:00,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 584 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:11:00,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-04 01:11:00,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 191. [2025-03-04 01:11:00,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 168 states have (on average 1.375) internal successors, (231), 169 states have internal predecessors, (231), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:11:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 271 transitions. [2025-03-04 01:11:00,212 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 271 transitions. Word has length 149 [2025-03-04 01:11:00,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:00,212 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 271 transitions. [2025-03-04 01:11:00,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:11:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 271 transitions. [2025-03-04 01:11:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 01:11:00,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:00,214 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:00,226 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:11:00,414 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:11:00,414 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:00,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:00,415 INFO L85 PathProgramCache]: Analyzing trace with hash -848052229, now seen corresponding path program 1 times [2025-03-04 01:11:00,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:00,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668352702] [2025-03-04 01:11:00,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:00,415 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:11:00,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:00,417 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:11:00,418 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:11:00,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 01:11:00,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 01:11:00,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:00,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:00,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:11:00,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:00,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:11:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:11:02,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:02,210 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:02,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668352702] [2025-03-04 01:11:02,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668352702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:02,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:02,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:11:02,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083128565] [2025-03-04 01:11:02,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:02,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:11:02,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:11:02,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:11:02,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:11:02,212 INFO L87 Difference]: Start difference. First operand 191 states and 271 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:11:03,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:03,273 INFO L93 Difference]: Finished difference Result 512 states and 727 transitions. [2025-03-04 01:11:03,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:11:03,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 150 [2025-03-04 01:11:03,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:03,276 INFO L225 Difference]: With dead ends: 512 [2025-03-04 01:11:03,276 INFO L226 Difference]: Without dead ends: 324 [2025-03-04 01:11:03,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:03,277 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 150 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:03,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 570 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:11:03,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-04 01:11:03,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 299. [2025-03-04 01:11:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.359375) internal successors, (348), 257 states have internal predecessors, (348), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:11:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 424 transitions. [2025-03-04 01:11:03,300 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 424 transitions. Word has length 150 [2025-03-04 01:11:03,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:03,300 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 424 transitions. [2025-03-04 01:11:03,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:11:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 424 transitions. [2025-03-04 01:11:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:11:03,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:03,303 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:03,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:11:03,504 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:11:03,504 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:03,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:03,505 INFO L85 PathProgramCache]: Analyzing trace with hash 160841780, now seen corresponding path program 1 times [2025-03-04 01:11:03,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:03,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492255395] [2025-03-04 01:11:03,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:03,505 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:11:03,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:03,507 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:11:03,507 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:11:03,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:11:03,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:11:03,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:03,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:03,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:11:03,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:04,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:04,134 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:11:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-04 01:11:04,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:04,172 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:04,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492255395] [2025-03-04 01:11:04,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492255395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:04,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:04,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:11:04,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046552263] [2025-03-04 01:11:04,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:04,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:11:04,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:11:04,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:11:04,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:04,173 INFO L87 Difference]: Start difference. First operand 299 states and 424 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:11:06,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:11:09,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:11:10,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:11:14,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:11:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:15,707 INFO L93 Difference]: Finished difference Result 578 states and 822 transitions. [2025-03-04 01:11:15,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:11:15,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2025-03-04 01:11:15,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:15,715 INFO L225 Difference]: With dead ends: 578 [2025-03-04 01:11:15,715 INFO L226 Difference]: Without dead ends: 301 [2025-03-04 01:11:15,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:11:15,718 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 149 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:15,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 519 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 11.4s Time] [2025-03-04 01:11:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-04 01:11:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2025-03-04 01:11:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.3515625) internal successors, (346), 257 states have internal predecessors, (346), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:11:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 422 transitions. [2025-03-04 01:11:15,742 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 422 transitions. Word has length 151 [2025-03-04 01:11:15,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:15,742 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 422 transitions. [2025-03-04 01:11:15,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:11:15,742 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 422 transitions. [2025-03-04 01:11:15,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 01:11:15,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:15,743 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:15,761 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:11:15,943 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:11:15,944 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:15,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:15,944 INFO L85 PathProgramCache]: Analyzing trace with hash -669549162, now seen corresponding path program 1 times [2025-03-04 01:11:15,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:15,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804589804] [2025-03-04 01:11:15,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:15,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:15,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:15,946 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:11:15,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:11:16,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 01:11:16,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 01:11:16,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:16,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:16,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:11:16,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:16,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:16,738 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 175 treesize of output 67 [2025-03-04 01:11:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-04 01:11:16,777 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:16,777 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:16,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804589804] [2025-03-04 01:11:16,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804589804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:16,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:16,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:11:16,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262535471] [2025-03-04 01:11:16,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:16,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:11:16,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:11:16,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:11:16,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:16,778 INFO L87 Difference]: Start difference. First operand 299 states and 422 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:11:22,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:11:24,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:11:29,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:11:30,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:11:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:31,073 INFO L93 Difference]: Finished difference Result 571 states and 808 transitions. [2025-03-04 01:11:31,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:11:31,081 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 153 [2025-03-04 01:11:31,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:31,083 INFO L225 Difference]: With dead ends: 571 [2025-03-04 01:11:31,083 INFO L226 Difference]: Without dead ends: 301 [2025-03-04 01:11:31,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:11:31,084 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 139 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:31,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 515 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 2 Unknown, 0 Unchecked, 14.2s Time] [2025-03-04 01:11:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-04 01:11:31,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2025-03-04 01:11:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.34375) internal successors, (344), 257 states have internal predecessors, (344), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:11:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 420 transitions. [2025-03-04 01:11:31,096 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 420 transitions. Word has length 153 [2025-03-04 01:11:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:31,096 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 420 transitions. [2025-03-04 01:11:31,096 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:11:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 420 transitions. [2025-03-04 01:11:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-04 01:11:31,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:31,097 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:31,114 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:11:31,300 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:11:31,300 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:31,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:31,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1481372236, now seen corresponding path program 1 times [2025-03-04 01:11:31,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:31,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461337688] [2025-03-04 01:11:31,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:31,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:11:31,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:31,302 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:11:31,303 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:11:31,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 01:11:31,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 01:11:31,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:31,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:31,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:11:31,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:32,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:32,087 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:11:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-04 01:11:32,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:32,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:32,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461337688] [2025-03-04 01:11:32,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461337688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:32,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:32,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:11:32,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778592325] [2025-03-04 01:11:32,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:32,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:11:32,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:11:32,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:11:32,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:32,132 INFO L87 Difference]: Start difference. First operand 299 states and 420 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:11:37,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:11:40,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:11:44,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:11:46,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:11:46,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:46,577 INFO L93 Difference]: Finished difference Result 564 states and 794 transitions. [2025-03-04 01:11:46,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:11:46,585 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 155 [2025-03-04 01:11:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:46,586 INFO L225 Difference]: With dead ends: 564 [2025-03-04 01:11:46,586 INFO L226 Difference]: Without dead ends: 301 [2025-03-04 01:11:46,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 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:11:46,587 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 131 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:46,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 511 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 2 Unknown, 0 Unchecked, 14.4s Time] [2025-03-04 01:11:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-04 01:11:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2025-03-04 01:11:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 256 states have (on average 1.3359375) internal successors, (342), 257 states have internal predecessors, (342), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:11:46,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 418 transitions. [2025-03-04 01:11:46,601 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 418 transitions. Word has length 155 [2025-03-04 01:11:46,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:46,602 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 418 transitions. [2025-03-04 01:11:46,602 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:11:46,602 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 418 transitions. [2025-03-04 01:11:46,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:11:46,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:46,602 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:46,617 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:11:46,803 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:11:46,803 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:46,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:46,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1631645974, now seen corresponding path program 1 times [2025-03-04 01:11:46,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:11:46,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078858040] [2025-03-04 01:11:46,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:46,804 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:11:46,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:11:46,806 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:11:46,806 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:11:46,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:11:47,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:11:47,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:47,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:47,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 01:11:47,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:47,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2025-03-04 01:11:51,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:51,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 108 [2025-03-04 01:11:52,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:52,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 267 treesize of output 117 [2025-03-04 01:11:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-03-04 01:11:52,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:11:53,567 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:11:53,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078858040] [2025-03-04 01:11:53,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078858040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:53,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [532517560] [2025-03-04 01:11:53,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:53,567 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:11:53,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:11:53,569 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:11:53,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-03-04 01:11:53,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:11:56,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:11:56,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:56,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:56,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 01:11:56,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:57,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-04 01:12:03,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:03,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 100 [2025-03-04 01:12:04,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:12:04,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 68