./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.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-22.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 f15b1832185bc6e5ed8ca3a7e02ddd56b37c4032577256d66dd546b8130db09b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:03:01,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:03:01,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:03:01,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:03:01,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:03:01,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:03:01,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:03:01,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:03:01,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:03:01,078 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:03:01,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:03:01,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:03:01,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:03:01,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:03:01,078 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:03:01,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:03:01,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:03:01,079 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:03:01,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:03:01,079 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:03:01,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:03:01,079 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:03:01,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:03:01,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:03:01,079 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:03:01,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:03:01,080 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:03:01,080 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:03:01,080 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:03:01,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:03:01,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:03:01,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:03:01,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:03:01,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:03:01,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:03:01,081 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:03:01,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:03:01,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:03:01,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:03:01,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:03:01,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:03:01,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:03:01,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:03:01,081 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 -> f15b1832185bc6e5ed8ca3a7e02ddd56b37c4032577256d66dd546b8130db09b [2025-03-04 01:03:01,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:03:01,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:03:01,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:03:01,333 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:03:01,333 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:03:01,335 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-22.i [2025-03-04 01:03:02,488 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cf177204/e43929c1cc6e42d397b4d0981fb7b855/FLAG642d49a74 [2025-03-04 01:03:02,776 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:03:02,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i [2025-03-04 01:03:02,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cf177204/e43929c1cc6e42d397b4d0981fb7b855/FLAG642d49a74 [2025-03-04 01:03:03,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cf177204/e43929c1cc6e42d397b4d0981fb7b855 [2025-03-04 01:03:03,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:03:03,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:03:03,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:03:03,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:03:03,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:03:03,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:03:03" (1/1) ... [2025-03-04 01:03:03,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c94dd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:03, skipping insertion in model container [2025-03-04 01:03:03,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:03:03" (1/1) ... [2025-03-04 01:03:03,094 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:03:03,196 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-22.i[916,929] [2025-03-04 01:03:03,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:03:03,254 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:03:03,265 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-22.i[916,929] [2025-03-04 01:03:03,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:03:03,324 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:03:03,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:03 WrapperNode [2025-03-04 01:03:03,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:03:03,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:03:03,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:03:03,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:03:03,332 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:03:03" (1/1) ... [2025-03-04 01:03:03,342 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:03:03" (1/1) ... [2025-03-04 01:03:03,380 INFO L138 Inliner]: procedures = 29, calls = 121, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 415 [2025-03-04 01:03:03,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:03:03,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:03:03,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:03:03,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:03:03,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:03" (1/1) ... [2025-03-04 01:03:03,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:03" (1/1) ... [2025-03-04 01:03:03,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:03" (1/1) ... [2025-03-04 01:03:03,414 INFO L175 MemorySlicer]: Split 96 memory accesses to 6 slices as follows [2, 8, 29, 8, 16, 33]. 34 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 4, 1, 2, 2]. The 14 writes are split as follows [0, 1, 4, 2, 4, 3]. [2025-03-04 01:03:03,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:03" (1/1) ... [2025-03-04 01:03:03,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:03" (1/1) ... [2025-03-04 01:03:03,434 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:03" (1/1) ... [2025-03-04 01:03:03,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:03" (1/1) ... [2025-03-04 01:03:03,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:03" (1/1) ... [2025-03-04 01:03:03,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:03" (1/1) ... [2025-03-04 01:03:03,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:03:03,455 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:03:03,455 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:03:03,456 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:03:03,456 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:03" (1/1) ... [2025-03-04 01:03:03,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:03:03,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:03:03,482 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:03:03,487 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:03:03,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:03:03,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:03:03,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:03:03,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:03:03,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:03:03,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:03:03,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:03:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:03:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:03:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:03:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:03:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:03:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:03:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:03:03,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:03:03,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:03:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:03:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:03:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:03:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:03:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:03:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:03:03,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:03:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:03:03,508 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:03:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:03:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:03:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:03:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:03:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:03:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:03:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:03:03,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:03:03,631 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:03:03,634 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:03:03,986 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L92: havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~ite73#1;havoc property_#t~mem68#1;havoc property_#t~mem67#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~mem70#1;havoc property_#t~mem74#1;havoc property_#t~ite81#1;havoc property_#t~mem75#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem76#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~short82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite89#1;havoc property_#t~mem88#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~bitwise92#1;havoc property_#t~ite107#1;havoc property_#t~mem102#1;havoc property_#t~mem93#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem96#1;havoc property_#t~ite101#1;havoc property_#t~mem97#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem100#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1; [2025-03-04 01:03:04,016 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-03-04 01:03:04,016 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:03:04,032 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:03:04,032 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:03:04,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:03:04 BoogieIcfgContainer [2025-03-04 01:03:04,032 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:03:04,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:03:04,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:03:04,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:03:04,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:03:03" (1/3) ... [2025-03-04 01:03:04,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793d829b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:03:04, skipping insertion in model container [2025-03-04 01:03:04,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:03" (2/3) ... [2025-03-04 01:03:04,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793d829b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:03:04, skipping insertion in model container [2025-03-04 01:03:04,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:03:04" (3/3) ... [2025-03-04 01:03:04,040 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-22.i [2025-03-04 01:03:04,050 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:03:04,051 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-22.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:03:04,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:03:04,095 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;@efb9147, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:03:04,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:03:04,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:03:04,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 01:03:04,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:04,107 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:04,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:04,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:04,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1188834697, now seen corresponding path program 1 times [2025-03-04 01:03:04,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:04,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929379679] [2025-03-04 01:03:04,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:04,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:04,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 01:03:04,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 01:03:04,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:04,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-04 01:03:04,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:04,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929379679] [2025-03-04 01:03:04,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929379679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:04,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084556283] [2025-03-04 01:03:04,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:04,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:04,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:03:04,334 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:03:04,336 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:03:04,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 01:03:04,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 01:03:04,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:04,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:04,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:03:04,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-04 01:03:04,556 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:04,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084556283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:04,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:03:04,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:03:04,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275089309] [2025-03-04 01:03:04,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:04,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:03:04,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:04,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:03:04,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:03:04,577 INFO L87 Difference]: Start difference. First operand has 104 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 93 states have internal predecessors, (134), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:03:04,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:04,603 INFO L93 Difference]: Finished difference Result 202 states and 308 transitions. [2025-03-04 01:03:04,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:03:04,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2025-03-04 01:03:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:04,611 INFO L225 Difference]: With dead ends: 202 [2025-03-04 01:03:04,612 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:03:04,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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:03:04,618 INFO L435 NwaCegarLoop]: 144 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, 144 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:03:04,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:03:04,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:03:04,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 01:03:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:03:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2025-03-04 01:03:04,648 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 90 [2025-03-04 01:03:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:04,649 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2025-03-04 01:03:04,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:03:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2025-03-04 01:03:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 01:03:04,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:04,653 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:04,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:03:04,853 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:03:04,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:04,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:04,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1010601478, now seen corresponding path program 1 times [2025-03-04 01:03:04,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:04,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870913996] [2025-03-04 01:03:04,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:04,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:04,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 01:03:04,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 01:03:04,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:04,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:05,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:05,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870913996] [2025-03-04 01:03:05,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870913996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:05,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:05,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:03:05,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725568838] [2025-03-04 01:03:05,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:05,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:03:05,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:05,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:03:05,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:03:05,089 INFO L87 Difference]: Start difference. First operand 101 states and 146 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:03:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:05,124 INFO L93 Difference]: Finished difference Result 201 states and 292 transitions. [2025-03-04 01:03:05,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:03:05,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2025-03-04 01:03:05,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:05,126 INFO L225 Difference]: With dead ends: 201 [2025-03-04 01:03:05,126 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 01:03:05,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:03:05,127 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 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:03:05,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:03:05,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 01:03:05,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-04 01:03:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:03:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 148 transitions. [2025-03-04 01:03:05,141 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 148 transitions. Word has length 90 [2025-03-04 01:03:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:05,142 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 148 transitions. [2025-03-04 01:03:05,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:03:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2025-03-04 01:03:05,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 01:03:05,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:05,148 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:05,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:03:05,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:05,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:05,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1109685721, now seen corresponding path program 1 times [2025-03-04 01:03:05,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:05,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923203809] [2025-03-04 01:03:05,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:05,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:05,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 01:03:05,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 01:03:05,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:05,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:05,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:05,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923203809] [2025-03-04 01:03:05,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923203809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:05,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:05,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:03:05,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860617958] [2025-03-04 01:03:05,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:05,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:03:05,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:05,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:03:05,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:03:05,813 INFO L87 Difference]: Start difference. First operand 103 states and 148 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:06,579 INFO L93 Difference]: Finished difference Result 535 states and 770 transitions. [2025-03-04 01:03:06,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:03:06,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2025-03-04 01:03:06,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:06,582 INFO L225 Difference]: With dead ends: 535 [2025-03-04 01:03:06,585 INFO L226 Difference]: Without dead ends: 435 [2025-03-04 01:03:06,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:03:06,586 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 582 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:06,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 949 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:03:06,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-03-04 01:03:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 288. [2025-03-04 01:03:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 257 states have (on average 1.4085603112840468) internal successors, (362), 257 states have internal predecessors, (362), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:03:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 416 transitions. [2025-03-04 01:03:06,629 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 416 transitions. Word has length 90 [2025-03-04 01:03:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:06,629 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 416 transitions. [2025-03-04 01:03:06,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 416 transitions. [2025-03-04 01:03:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 01:03:06,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:06,631 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:06,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:03:06,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:06,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:06,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1672054111, now seen corresponding path program 1 times [2025-03-04 01:03:06,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:06,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713897309] [2025-03-04 01:03:06,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:06,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:06,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 01:03:06,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 01:03:06,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:06,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:06,723 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:06,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:06,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713897309] [2025-03-04 01:03:06,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713897309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:06,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:06,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:03:06,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058075478] [2025-03-04 01:03:06,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:06,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:03:06,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:06,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:03:06,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:03:06,726 INFO L87 Difference]: Start difference. First operand 288 states and 416 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:06,749 INFO L93 Difference]: Finished difference Result 591 states and 857 transitions. [2025-03-04 01:03:06,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:03:06,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2025-03-04 01:03:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:06,752 INFO L225 Difference]: With dead ends: 591 [2025-03-04 01:03:06,752 INFO L226 Difference]: Without dead ends: 306 [2025-03-04 01:03:06,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:03:06,754 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 28 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:06,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 278 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:03:06,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-04 01:03:06,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 204. [2025-03-04 01:03:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.3989071038251366) internal successors, (256), 183 states have internal predecessors, (256), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:03:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 292 transitions. [2025-03-04 01:03:06,772 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 292 transitions. Word has length 91 [2025-03-04 01:03:06,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:06,772 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 292 transitions. [2025-03-04 01:03:06,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 292 transitions. [2025-03-04 01:03:06,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 01:03:06,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:06,775 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:06,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:03:06,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:06,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:06,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1916831774, now seen corresponding path program 1 times [2025-03-04 01:03:06,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:06,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278099983] [2025-03-04 01:03:06,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:06,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:06,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 01:03:06,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 01:03:06,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:06,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:06,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:06,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278099983] [2025-03-04 01:03:06,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278099983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:06,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:06,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:03:06,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103356377] [2025-03-04 01:03:06,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:06,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:03:06,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:06,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:03:06,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:03:06,848 INFO L87 Difference]: Start difference. First operand 204 states and 292 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:06,901 INFO L93 Difference]: Finished difference Result 366 states and 523 transitions. [2025-03-04 01:03:06,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:03:06,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2025-03-04 01:03:06,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:06,904 INFO L225 Difference]: With dead ends: 366 [2025-03-04 01:03:06,905 INFO L226 Difference]: Without dead ends: 165 [2025-03-04 01:03:06,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:03:06,906 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:06,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:03:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-04 01:03:06,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2025-03-04 01:03:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 130 states have (on average 1.3615384615384616) internal successors, (177), 130 states have internal predecessors, (177), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:03:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 213 transitions. [2025-03-04 01:03:06,920 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 213 transitions. Word has length 92 [2025-03-04 01:03:06,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:06,921 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 213 transitions. [2025-03-04 01:03:06,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:06,921 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 213 transitions. [2025-03-04 01:03:06,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 01:03:06,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:06,921 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:06,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:03:06,922 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:06,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:06,922 INFO L85 PathProgramCache]: Analyzing trace with hash 883716811, now seen corresponding path program 1 times [2025-03-04 01:03:06,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:06,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345883447] [2025-03-04 01:03:06,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:06,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:06,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 01:03:07,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 01:03:07,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:07,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:07,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:07,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345883447] [2025-03-04 01:03:07,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345883447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:07,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:07,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:03:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239466975] [2025-03-04 01:03:07,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:07,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:03:07,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:07,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:03:07,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:03:07,670 INFO L87 Difference]: Start difference. First operand 151 states and 213 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:08,078 INFO L93 Difference]: Finished difference Result 549 states and 778 transitions. [2025-03-04 01:03:08,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:03:08,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2025-03-04 01:03:08,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:08,082 INFO L225 Difference]: With dead ends: 549 [2025-03-04 01:03:08,082 INFO L226 Difference]: Without dead ends: 450 [2025-03-04 01:03:08,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:03:08,083 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 417 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:08,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1679 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:03:08,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-04 01:03:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 271. [2025-03-04 01:03:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 240 states have (on average 1.3791666666666667) internal successors, (331), 240 states have internal predecessors, (331), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:03:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 385 transitions. [2025-03-04 01:03:08,110 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 385 transitions. Word has length 95 [2025-03-04 01:03:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:08,110 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 385 transitions. [2025-03-04 01:03:08,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 385 transitions. [2025-03-04 01:03:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 01:03:08,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:08,112 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:08,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:03:08,113 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:08,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:08,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1837060939, now seen corresponding path program 1 times [2025-03-04 01:03:08,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:08,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885690306] [2025-03-04 01:03:08,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:08,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:08,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:03:08,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:03:08,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:08,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:08,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:08,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885690306] [2025-03-04 01:03:08,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885690306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:08,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:08,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:03:08,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259952308] [2025-03-04 01:03:08,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:08,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:03:08,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:08,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:03:08,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:03:08,751 INFO L87 Difference]: Start difference. First operand 271 states and 385 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:03:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:09,248 INFO L93 Difference]: Finished difference Result 803 states and 1146 transitions. [2025-03-04 01:03:09,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:03:09,248 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 96 [2025-03-04 01:03:09,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:09,251 INFO L225 Difference]: With dead ends: 803 [2025-03-04 01:03:09,252 INFO L226 Difference]: Without dead ends: 587 [2025-03-04 01:03:09,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:03:09,253 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 406 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:09,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 812 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:03:09,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-03-04 01:03:09,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 285. [2025-03-04 01:03:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 254 states have (on average 1.3779527559055118) internal successors, (350), 254 states have internal predecessors, (350), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:03:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 404 transitions. [2025-03-04 01:03:09,271 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 404 transitions. Word has length 96 [2025-03-04 01:03:09,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:09,271 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 404 transitions. [2025-03-04 01:03:09,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:03:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 404 transitions. [2025-03-04 01:03:09,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 01:03:09,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:09,272 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:09,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:03:09,272 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:09,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:09,272 INFO L85 PathProgramCache]: Analyzing trace with hash 839988586, now seen corresponding path program 1 times [2025-03-04 01:03:09,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:09,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030407261] [2025-03-04 01:03:09,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:09,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:09,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:03:09,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:03:09,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:09,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:09,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:09,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030407261] [2025-03-04 01:03:09,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030407261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:09,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:09,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:03:09,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193827298] [2025-03-04 01:03:09,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:09,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:03:09,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:09,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:03:09,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:03:09,727 INFO L87 Difference]: Start difference. First operand 285 states and 404 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:03:10,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:10,255 INFO L93 Difference]: Finished difference Result 701 states and 998 transitions. [2025-03-04 01:03:10,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:03:10,256 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 96 [2025-03-04 01:03:10,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:10,258 INFO L225 Difference]: With dead ends: 701 [2025-03-04 01:03:10,258 INFO L226 Difference]: Without dead ends: 481 [2025-03-04 01:03:10,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:03:10,259 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 255 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:10,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 858 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:03:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-04 01:03:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 281. [2025-03-04 01:03:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 250 states have (on average 1.376) internal successors, (344), 250 states have internal predecessors, (344), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:03:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 398 transitions. [2025-03-04 01:03:10,278 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 398 transitions. Word has length 96 [2025-03-04 01:03:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:10,279 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 398 transitions. [2025-03-04 01:03:10,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:03:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 398 transitions. [2025-03-04 01:03:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 01:03:10,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:10,280 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:10,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:03:10,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:10,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:10,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1031165649, now seen corresponding path program 1 times [2025-03-04 01:03:10,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:10,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845555606] [2025-03-04 01:03:10,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:10,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:10,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:03:10,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:03:10,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:10,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:10,624 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:10,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:10,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845555606] [2025-03-04 01:03:10,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845555606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:10,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:10,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:03:10,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277133864] [2025-03-04 01:03:10,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:10,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:03:10,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:10,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:03:10,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:03:10,627 INFO L87 Difference]: Start difference. First operand 281 states and 398 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:10,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:10,777 INFO L93 Difference]: Finished difference Result 498 states and 707 transitions. [2025-03-04 01:03:10,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:03:10,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-03-04 01:03:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:10,782 INFO L225 Difference]: With dead ends: 498 [2025-03-04 01:03:10,782 INFO L226 Difference]: Without dead ends: 278 [2025-03-04 01:03:10,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:03:10,783 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 209 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:10,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 561 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:03:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-04 01:03:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2025-03-04 01:03:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 245 states have (on average 1.3673469387755102) internal successors, (335), 245 states have internal predecessors, (335), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:03:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 389 transitions. [2025-03-04 01:03:10,800 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 389 transitions. Word has length 96 [2025-03-04 01:03:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:10,800 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 389 transitions. [2025-03-04 01:03:10,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 389 transitions. [2025-03-04 01:03:10,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 01:03:10,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:10,800 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:10,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:03:10,801 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:10,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:10,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1375288998, now seen corresponding path program 1 times [2025-03-04 01:03:10,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:10,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612138160] [2025-03-04 01:03:10,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:10,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:10,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 01:03:10,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 01:03:10,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:10,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:03:11,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:11,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612138160] [2025-03-04 01:03:11,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612138160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:11,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490483661] [2025-03-04 01:03:11,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:11,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:11,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:03:11,176 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:03:11,178 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:03:11,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 01:03:11,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 01:03:11,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:11,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:11,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 01:03:11,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:11,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:03:11,587 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 251 treesize of output 167 [2025-03-04 01:03:11,591 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 167 treesize of output 143 [2025-03-04 01:03:11,630 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:11,630 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:11,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490483661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:11,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:03:11,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2025-03-04 01:03:11,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963315882] [2025-03-04 01:03:11,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:11,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:03:11,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:11,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:03:11,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:03:11,632 INFO L87 Difference]: Start difference. First operand 276 states and 389 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:11,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:11,782 INFO L93 Difference]: Finished difference Result 475 states and 671 transitions. [2025-03-04 01:03:11,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:03:11,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2025-03-04 01:03:11,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:11,784 INFO L225 Difference]: With dead ends: 475 [2025-03-04 01:03:11,784 INFO L226 Difference]: Without dead ends: 376 [2025-03-04 01:03:11,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:03:11,786 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 122 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:11,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 631 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:03:11,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-04 01:03:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 278. [2025-03-04 01:03:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 247 states have (on average 1.3643724696356276) internal successors, (337), 247 states have internal predecessors, (337), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:03:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 391 transitions. [2025-03-04 01:03:11,803 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 391 transitions. Word has length 97 [2025-03-04 01:03:11,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:11,803 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 391 transitions. [2025-03-04 01:03:11,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:11,803 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 391 transitions. [2025-03-04 01:03:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 01:03:11,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:11,807 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:11,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:03:12,007 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,SelfDestructingSolverStorable9 [2025-03-04 01:03:12,007 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:12,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:12,008 INFO L85 PathProgramCache]: Analyzing trace with hash 245591753, now seen corresponding path program 1 times [2025-03-04 01:03:12,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:12,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179134887] [2025-03-04 01:03:12,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:12,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:12,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 01:03:12,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 01:03:12,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:12,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:12,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:12,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179134887] [2025-03-04 01:03:12,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179134887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:12,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:12,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:03:12,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899308314] [2025-03-04 01:03:12,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:12,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:03:12,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:12,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:03:12,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:03:12,438 INFO L87 Difference]: Start difference. First operand 278 states and 391 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:12,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:12,656 INFO L93 Difference]: Finished difference Result 452 states and 635 transitions. [2025-03-04 01:03:12,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:03:12,656 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2025-03-04 01:03:12,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:12,659 INFO L225 Difference]: With dead ends: 452 [2025-03-04 01:03:12,659 INFO L226 Difference]: Without dead ends: 336 [2025-03-04 01:03:12,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:03:12,661 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 167 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:12,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1059 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:03:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-04 01:03:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 303. [2025-03-04 01:03:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 272 states have (on average 1.3676470588235294) internal successors, (372), 272 states have internal predecessors, (372), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:03:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 426 transitions. [2025-03-04 01:03:12,675 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 426 transitions. Word has length 97 [2025-03-04 01:03:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:12,675 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 426 transitions. [2025-03-04 01:03:12,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 426 transitions. [2025-03-04 01:03:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 01:03:12,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:12,676 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:12,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:03:12,676 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:12,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:12,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1998453458, now seen corresponding path program 1 times [2025-03-04 01:03:12,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:12,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104811928] [2025-03-04 01:03:12,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:12,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:12,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 01:03:12,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 01:03:12,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:12,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:12,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:12,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104811928] [2025-03-04 01:03:12,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104811928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:12,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:12,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:03:12,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516000307] [2025-03-04 01:03:12,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:12,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:03:12,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:12,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:03:12,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:03:12,988 INFO L87 Difference]: Start difference. First operand 303 states and 426 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:13,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:13,180 INFO L93 Difference]: Finished difference Result 501 states and 703 transitions. [2025-03-04 01:03:13,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:03:13,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2025-03-04 01:03:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:13,183 INFO L225 Difference]: With dead ends: 501 [2025-03-04 01:03:13,183 INFO L226 Difference]: Without dead ends: 377 [2025-03-04 01:03:13,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:03:13,183 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 322 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:13,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 850 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:03:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-04 01:03:13,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 299. [2025-03-04 01:03:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 268 states have (on average 1.3619402985074627) internal successors, (365), 268 states have internal predecessors, (365), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:03:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 419 transitions. [2025-03-04 01:03:13,198 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 419 transitions. Word has length 97 [2025-03-04 01:03:13,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:13,198 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 419 transitions. [2025-03-04 01:03:13,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 419 transitions. [2025-03-04 01:03:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 01:03:13,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:13,200 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:13,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:03:13,200 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:13,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:13,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2134787736, now seen corresponding path program 1 times [2025-03-04 01:03:13,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:13,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749215546] [2025-03-04 01:03:13,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:13,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:13,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 01:03:13,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 01:03:13,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:13,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:13,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:13,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749215546] [2025-03-04 01:03:13,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749215546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:13,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:13,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:03:13,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409507672] [2025-03-04 01:03:13,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:13,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:03:13,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:13,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:03:13,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:03:13,388 INFO L87 Difference]: Start difference. First operand 299 states and 419 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:03:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:13,439 INFO L93 Difference]: Finished difference Result 487 states and 686 transitions. [2025-03-04 01:03:13,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:03:13,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2025-03-04 01:03:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:13,442 INFO L225 Difference]: With dead ends: 487 [2025-03-04 01:03:13,442 INFO L226 Difference]: Without dead ends: 369 [2025-03-04 01:03:13,442 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:03:13,443 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 156 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:13,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 618 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:03:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-04 01:03:13,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 300. [2025-03-04 01:03:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 269 states have (on average 1.3568773234200744) internal successors, (365), 269 states have internal predecessors, (365), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:03:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 419 transitions. [2025-03-04 01:03:13,454 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 419 transitions. Word has length 98 [2025-03-04 01:03:13,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:13,454 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 419 transitions. [2025-03-04 01:03:13,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:03:13,455 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 419 transitions. [2025-03-04 01:03:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 01:03:13,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:13,455 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:13,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:03:13,455 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:13,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:13,456 INFO L85 PathProgramCache]: Analyzing trace with hash -890023255, now seen corresponding path program 1 times [2025-03-04 01:03:13,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:13,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463569012] [2025-03-04 01:03:13,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:13,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:13,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 01:03:13,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 01:03:13,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:13,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:13,578 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:13,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:13,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463569012] [2025-03-04 01:03:13,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463569012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:13,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:13,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:03:13,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315312169] [2025-03-04 01:03:13,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:13,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:03:13,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:13,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:03:13,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:03:13,579 INFO L87 Difference]: Start difference. First operand 300 states and 419 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:13,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:13,591 INFO L93 Difference]: Finished difference Result 420 states and 586 transitions. [2025-03-04 01:03:13,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:03:13,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2025-03-04 01:03:13,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:13,592 INFO L225 Difference]: With dead ends: 420 [2025-03-04 01:03:13,592 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 01:03:13,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:03:13,593 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:13,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:03:13,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 01:03:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2025-03-04 01:03:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 155 states have (on average 1.3161290322580645) internal successors, (204), 155 states have internal predecessors, (204), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:03:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 240 transitions. [2025-03-04 01:03:13,600 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 240 transitions. Word has length 98 [2025-03-04 01:03:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:13,600 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 240 transitions. [2025-03-04 01:03:13,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:13,601 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 240 transitions. [2025-03-04 01:03:13,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:03:13,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:13,601 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:13,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:03:13,602 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:13,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:13,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1700506216, now seen corresponding path program 1 times [2025-03-04 01:03:13,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:13,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258910885] [2025-03-04 01:03:13,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:13,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:13,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:03:13,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:03:13,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:13,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:13,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:13,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258910885] [2025-03-04 01:03:13,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258910885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:13,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:13,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:03:13,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68915340] [2025-03-04 01:03:13,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:13,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:03:13,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:13,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:03:13,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:03:13,795 INFO L87 Difference]: Start difference. First operand 176 states and 240 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:03:13,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:13,839 INFO L93 Difference]: Finished difference Result 332 states and 457 transitions. [2025-03-04 01:03:13,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:03:13,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2025-03-04 01:03:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:13,844 INFO L225 Difference]: With dead ends: 332 [2025-03-04 01:03:13,844 INFO L226 Difference]: Without dead ends: 232 [2025-03-04 01:03:13,844 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:03:13,845 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 122 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:13,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 604 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:03:13,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-04 01:03:13,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 200. [2025-03-04 01:03:13,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 179 states have (on average 1.324022346368715) internal successors, (237), 179 states have internal predecessors, (237), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:03:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 273 transitions. [2025-03-04 01:03:13,853 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 273 transitions. Word has length 99 [2025-03-04 01:03:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:13,853 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 273 transitions. [2025-03-04 01:03:13,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:03:13,853 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 273 transitions. [2025-03-04 01:03:13,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:03:13,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:13,854 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:13,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:03:13,854 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:13,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:13,855 INFO L85 PathProgramCache]: Analyzing trace with hash 350415869, now seen corresponding path program 1 times [2025-03-04 01:03:13,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:13,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81995646] [2025-03-04 01:03:13,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:13,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:13,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:03:13,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:03:13,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:13,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:14,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:14,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81995646] [2025-03-04 01:03:14,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81995646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:14,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:14,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:03:14,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735105330] [2025-03-04 01:03:14,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:14,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:03:14,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:14,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:03:14,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:03:14,047 INFO L87 Difference]: Start difference. First operand 200 states and 273 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:03:14,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:14,096 INFO L93 Difference]: Finished difference Result 356 states and 489 transitions. [2025-03-04 01:03:14,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:03:14,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2025-03-04 01:03:14,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:14,098 INFO L225 Difference]: With dead ends: 356 [2025-03-04 01:03:14,098 INFO L226 Difference]: Without dead ends: 232 [2025-03-04 01:03:14,098 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:03:14,098 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 62 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:14,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 727 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:03:14,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-04 01:03:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 200. [2025-03-04 01:03:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 179 states have (on average 1.318435754189944) internal successors, (236), 179 states have internal predecessors, (236), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:03:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 272 transitions. [2025-03-04 01:03:14,107 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 272 transitions. Word has length 99 [2025-03-04 01:03:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:14,107 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 272 transitions. [2025-03-04 01:03:14,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:03:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 272 transitions. [2025-03-04 01:03:14,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:03:14,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:14,107 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:14,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:03:14,108 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:14,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash 479498588, now seen corresponding path program 1 times [2025-03-04 01:03:14,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:14,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648953761] [2025-03-04 01:03:14,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:14,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:14,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:03:14,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:03:14,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:14,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:03:14,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:14,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648953761] [2025-03-04 01:03:14,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648953761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:14,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702463494] [2025-03-04 01:03:14,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:14,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:14,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:03:14,195 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:03:14,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:03:14,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:03:14,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:03:14,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:14,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:14,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:03:14,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:14,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:14,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702463494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:14,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:03:14,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:03:14,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412870086] [2025-03-04 01:03:14,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:14,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:03:14,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:14,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:03:14,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:03:14,358 INFO L87 Difference]: Start difference. First operand 200 states and 272 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:14,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:14,384 INFO L93 Difference]: Finished difference Result 327 states and 448 transitions. [2025-03-04 01:03:14,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:03:14,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2025-03-04 01:03:14,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:14,385 INFO L225 Difference]: With dead ends: 327 [2025-03-04 01:03:14,385 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 01:03:14,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:03:14,386 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:14,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 526 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:03:14,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 01:03:14,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2025-03-04 01:03:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 178 states have (on average 1.3146067415730338) internal successors, (234), 178 states have internal predecessors, (234), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:03:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 270 transitions. [2025-03-04 01:03:14,394 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 270 transitions. Word has length 99 [2025-03-04 01:03:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:14,395 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 270 transitions. [2025-03-04 01:03:14,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 270 transitions. [2025-03-04 01:03:14,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 01:03:14,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:14,396 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:14,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:03:14,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:14,596 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:14,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:14,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1020115385, now seen corresponding path program 1 times [2025-03-04 01:03:14,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:14,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354397288] [2025-03-04 01:03:14,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:14,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:14,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:03:14,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:03:14,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:14,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:14,895 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:03:14,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:14,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354397288] [2025-03-04 01:03:14,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354397288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:14,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951900140] [2025-03-04 01:03:14,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:14,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:14,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:03:14,897 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:03:14,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:03:15,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 01:03:15,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 01:03:15,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:15,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:15,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 01:03:15,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:15,111 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 9 treesize of output 3 [2025-03-04 01:03:15,465 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 28 treesize of output 16 [2025-03-04 01:03:15,499 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 83 proven. 12 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-04 01:03:15,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:16,209 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 60 treesize of output 44 [2025-03-04 01:03:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-04 01:03:16,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951900140] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:03:16,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:03:16,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 30 [2025-03-04 01:03:16,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123513260] [2025-03-04 01:03:16,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:03:16,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 01:03:16,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:16,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 01:03:16,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2025-03-04 01:03:16,495 INFO L87 Difference]: Start difference. First operand 199 states and 270 transitions. Second operand has 30 states, 26 states have (on average 4.961538461538462) internal successors, (129), 29 states have internal predecessors, (129), 9 states have call successors, (27), 4 states have call predecessors, (27), 8 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-04 01:03:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:17,629 INFO L93 Difference]: Finished difference Result 464 states and 625 transitions. [2025-03-04 01:03:17,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 01:03:17,629 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 4.961538461538462) internal successors, (129), 29 states have internal predecessors, (129), 9 states have call successors, (27), 4 states have call predecessors, (27), 8 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) Word has length 99 [2025-03-04 01:03:17,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:17,631 INFO L225 Difference]: With dead ends: 464 [2025-03-04 01:03:17,631 INFO L226 Difference]: Without dead ends: 330 [2025-03-04 01:03:17,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=539, Invalid=1813, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 01:03:17,633 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 592 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:17,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1608 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:03:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-04 01:03:17,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 213. [2025-03-04 01:03:17,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 190 states have (on average 1.3) internal successors, (247), 190 states have internal predecessors, (247), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:03:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 283 transitions. [2025-03-04 01:03:17,642 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 283 transitions. Word has length 99 [2025-03-04 01:03:17,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:17,643 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 283 transitions. [2025-03-04 01:03:17,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 4.961538461538462) internal successors, (129), 29 states have internal predecessors, (129), 9 states have call successors, (27), 4 states have call predecessors, (27), 8 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-04 01:03:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 283 transitions. [2025-03-04 01:03:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 01:03:17,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:17,644 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:17,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 01:03:17,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 01:03:17,848 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:17,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:17,848 INFO L85 PathProgramCache]: Analyzing trace with hash 143950665, now seen corresponding path program 1 times [2025-03-04 01:03:17,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:17,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272155682] [2025-03-04 01:03:17,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:17,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:17,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 01:03:17,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 01:03:17,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:17,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:03:17,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:03:17,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 01:03:17,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 01:03:17,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:17,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:03:17,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:03:17,987 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:03:17,988 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:03:17,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:03:17,994 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:18,053 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:03:18,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:03:18 BoogieIcfgContainer [2025-03-04 01:03:18,061 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:03:18,062 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:03:18,062 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:03:18,062 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:03:18,062 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:03:04" (3/4) ... [2025-03-04 01:03:18,064 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:03:18,064 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:03:18,065 INFO L158 Benchmark]: Toolchain (without parser) took 14988.73ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 122.5MB in the beginning and 418.1MB in the end (delta: -295.6MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2025-03-04 01:03:18,065 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:03:18,066 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.85ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 108.1MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:03:18,066 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.35ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 104.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:03:18,066 INFO L158 Benchmark]: Boogie Preprocessor took 68.06ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 100.3MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:03:18,067 INFO L158 Benchmark]: IcfgBuilder took 577.58ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 66.1MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:03:18,067 INFO L158 Benchmark]: TraceAbstraction took 14026.64ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 66.1MB in the beginning and 418.2MB in the end (delta: -352.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:03:18,067 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 503.3MB. Free memory was 418.2MB in the beginning and 418.1MB in the end (delta: 87.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:03:18,068 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.22ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.85ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 108.1MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.35ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 104.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.06ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 100.3MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 577.58ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 66.1MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14026.64ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 66.1MB in the beginning and 418.2MB in the end (delta: -352.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 503.3MB. Free memory was 418.2MB in the beginning and 418.1MB in the end (delta: 87.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 someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of bitwiseAnd at line 57, overapproximation of someBinaryArithmeticFLOAToperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L25-L27] float float_Array_0[2][2] = { {64.2, 128.75}, {7.6, 5.9} }; [L28-L30] signed short int signed_short_int_Array_0[1] = { -5 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { -5 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 3135928546, 8 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 3135928546, 8 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 3135928546, 8 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 44772, 256 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 44772, 256 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 44772, 256 }; [L37] signed short int last_1_signed_short_int_Array_0_0_ = -5; [L38] unsigned long int last_1_unsigned_long_int_Array_0_1_ = 8; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] CALL updateLastVariables() [L88] EXPR signed_short_int_Array_0[0] [L88] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L89] EXPR unsigned_long_int_Array_0[1] [L89] last_1_unsigned_long_int_Array_0_1_ = unsigned_long_int_Array_0[1] [L99] RET updateLastVariables() [L100] 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}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_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, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_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, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_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}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_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}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_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, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_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, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_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}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] float_Array_0[0][0] = __VERIFIER_nondet_float() [L75] EXPR float_Array_0[0][0] [L75] EXPR float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F [L75] EXPR float_Array_0[0][0] [L75] EXPR float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR (float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR (float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not((float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_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, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not((float_Array_0[0][0] >= -230584.3009213691390e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 2305843.009213691390e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] float_Array_0[1][0] = __VERIFIER_nondet_float() [L77] EXPR float_Array_0[1][0] [L77] EXPR float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F [L77] EXPR float_Array_0[1][0] [L77] EXPR float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR (float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not((float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_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, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not((float_Array_0[1][0] >= -115292.1504606845700e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 1152921.504606845700e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] float_Array_0[0][1] = __VERIFIER_nondet_float() [L79] EXPR float_Array_0[0][1] [L79] EXPR float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F [L79] EXPR float_Array_0[0][1] [L79] EXPR float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] EXPR (float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not((float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_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, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not((float_Array_0[0][1] >= -461168.6018427382800e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 4611686.018427382800e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_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, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_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, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L84] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_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, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_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, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] RET updateVariables() [L101] CALL step() [L42] signed long int stepLocal_0 = last_1_signed_short_int_Array_0_0_; [L43] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L43] COND TRUE BOOL_unsigned_char_Array_0[0] [L44] unsigned_short_int_Array_0[1] = last_1_signed_short_int_Array_0_0_ VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L50] EXPR unsigned_short_int_Array_0[1] [L50] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L50] COND TRUE unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1] [L51] EXPR unsigned_short_int_Array_0[1] [L51] signed_short_int_Array_0[0] = (unsigned_short_int_Array_0[1] + -16) [L57] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] EXPR unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_ VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND TRUE last_1_unsigned_long_int_Array_0_1_ >= (unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_) [L58] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0]) [L58] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)) [L58] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0]) [L58] EXPR ((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] EXPR ((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, stepLocal_0=-5, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L58] unsigned_long_int_Array_0[1] = ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)))) [L66] EXPR signed_short_int_Array_0[0] [L66] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] COND TRUE signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1] [L67] EXPR float_Array_0[1][0] [L67] EXPR float_Array_0[0][0] [L67] EXPR float_Array_0[0][1] [L67] float_Array_0[1][1] = (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]) [L101] RET step() [L102] CALL, EXPR property() [L92] EXPR unsigned_short_int_Array_0[1] [L92] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1) [L92] EXPR signed_short_int_Array_0[0] [L92] EXPR unsigned_short_int_Array_0[1] [L92] EXPR (unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1)) [L92] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1) [L92] EXPR unsigned_short_int_Array_0[1] [L92] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1) [L92] EXPR signed_short_int_Array_0[0] [L92] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1 [L92] EXPR float_Array_0[1][1] [L92] EXPR float_Array_0[1][0] [L92] EXPR float_Array_0[0][0] [L92] EXPR float_Array_0[0][1] [L92] EXPR (signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR (((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1)) && ((last_1_unsigned_long_int_Array_0_1_ >= (unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_)) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)))))) : ((5.7 < float_Array_0[0][0]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)) : (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] EXPR ((((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1)) && ((last_1_unsigned_long_int_Array_0_1_ >= (unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_)) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)))))) : ((5.7 < float_Array_0[0][0]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)) : (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92-L93] return ((((unsigned_short_int_Array_0[1] == unsigned_short_int_Array_0[1]) ? (signed_short_int_Array_0[0] == ((signed short int) (unsigned_short_int_Array_0[1] + -16))) : (BOOL_unsigned_char_Array_0[0] ? (signed_short_int_Array_0[0] == ((signed short int) unsigned_short_int_Array_0[1])) : 1)) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) last_1_signed_short_int_Array_0_0_)) : ((last_1_signed_short_int_Array_0_0_ <= last_1_signed_short_int_Array_0_0_) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((last_1_unsigned_long_int_Array_0_1_) > ((unsigned_short_int_Array_0[0] - 8))) ? (last_1_unsigned_long_int_Array_0_1_) : ((unsigned_short_int_Array_0[0] - 8)))))) : 1))) && ((signed_short_int_Array_0[0] < unsigned_short_int_Array_0[1]) ? (float_Array_0[1][1] == ((float) (((10.25f + float_Array_0[1][0]) + float_Array_0[0][0]) + float_Array_0[0][1]))) : 1)) && ((last_1_unsigned_long_int_Array_0_1_ >= (unsigned_short_int_Array_0[1] & last_1_unsigned_long_int_Array_0_1_)) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) ((((((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) < ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_))) ? (((((((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) < (unsigned_short_int_Array_0[0])) ? (((((50u) < (last_1_unsigned_long_int_Array_0_1_)) ? (50u) : (last_1_unsigned_long_int_Array_0_1_)))) : (unsigned_short_int_Array_0[0])))) : ((unsigned_long_int_Array_0[0] - last_1_unsigned_long_int_Array_0_1_)))))) : ((5.7 < float_Array_0[0][0]) ? (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)) : (unsigned_long_int_Array_0[1] == ((unsigned long int) last_1_unsigned_long_int_Array_0_1_)))) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-5, last_1_unsigned_long_int_Array_0_1_=8, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 19, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3443 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3440 mSDsluCounter, 12834 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9735 mSDsCounter, 299 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4626 IncrementalHoareTripleChecker+Invalid, 4925 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 299 mSolverCounterUnsat, 3099 mSDtfsCounter, 4626 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 666 GetRequests, 507 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=11, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 1411 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 2205 NumberOfCodeBlocks, 2205 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2180 ConstructedInterpolants, 0 QuantifiedInterpolants, 10302 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1456 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 23 InterpolantComputations, 17 PerfectInterpolantSequences, 3230/3312 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:03:18,086 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-22.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 f15b1832185bc6e5ed8ca3a7e02ddd56b37c4032577256d66dd546b8130db09b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:03:19,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:03:19,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:03:19,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:03:19,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:03:19,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:03:19,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:03:19,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:03:19,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:03:19,986 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:03:19,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:03:19,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:03:19,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:03:19,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:03:19,988 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:03:19,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:03:19,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:03:19,988 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:03:19,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:03:19,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:03:19,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:03:19,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:03:19,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:03:19,988 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:03:19,989 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:03:19,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:03:19,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:03:19,989 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 -> f15b1832185bc6e5ed8ca3a7e02ddd56b37c4032577256d66dd546b8130db09b [2025-03-04 01:03:20,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:03:20,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:03:20,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:03:20,235 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:03:20,235 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:03:20,236 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-22.i [2025-03-04 01:03:21,447 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8733b1a20/00a9003240be4913a86483862d39e727/FLAGe3d468674 [2025-03-04 01:03:21,611 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:03:21,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-22.i [2025-03-04 01:03:21,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8733b1a20/00a9003240be4913a86483862d39e727/FLAGe3d468674 [2025-03-04 01:03:21,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8733b1a20/00a9003240be4913a86483862d39e727 [2025-03-04 01:03:21,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:03:21,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:03:21,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:03:21,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:03:21,635 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:03:21,636 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:03:21" (1/1) ... [2025-03-04 01:03:21,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@522cb537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:21, skipping insertion in model container [2025-03-04 01:03:21,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:03:21" (1/1) ... [2025-03-04 01:03:21,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:03:21,736 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-22.i[916,929] [2025-03-04 01:03:21,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:03:21,781 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:03:21,788 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-22.i[916,929] [2025-03-04 01:03:21,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:03:21,833 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:03:21,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:21 WrapperNode [2025-03-04 01:03:21,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:03:21,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:03:21,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:03:21,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:03:21,839 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:03:21" (1/1) ... [2025-03-04 01:03:21,853 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:03:21" (1/1) ... [2025-03-04 01:03:21,873 INFO L138 Inliner]: procedures = 36, calls = 121, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 397 [2025-03-04 01:03:21,873 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:03:21,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:03:21,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:03:21,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:03:21,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:21" (1/1) ... [2025-03-04 01:03:21,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:21" (1/1) ... [2025-03-04 01:03:21,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:21" (1/1) ... [2025-03-04 01:03:21,907 INFO L175 MemorySlicer]: Split 96 memory accesses to 6 slices as follows [2, 8, 29, 8, 16, 33]. 34 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 4, 1, 2, 2]. The 14 writes are split as follows [0, 1, 4, 2, 4, 3]. [2025-03-04 01:03:21,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:21" (1/1) ... [2025-03-04 01:03:21,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:21" (1/1) ... [2025-03-04 01:03:21,935 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:21" (1/1) ... [2025-03-04 01:03:21,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:21" (1/1) ... [2025-03-04 01:03:21,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:21" (1/1) ... [2025-03-04 01:03:21,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:21" (1/1) ... [2025-03-04 01:03:21,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:03:21,954 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:03:21,954 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:03:21,954 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:03:21,955 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:21" (1/1) ... [2025-03-04 01:03:21,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:03:21,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:03:21,979 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:03:21,984 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:03:21,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:03:21,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:03:21,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:03:21,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:03:21,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:03:21,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:03:21,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:03:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:03:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:03:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 01:03:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 01:03:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 01:03:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-04 01:03:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:03:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:03:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:03:22,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:03:22,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:03:22,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:03:22,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:03:22,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:03:22,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:03:22,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:03:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:03:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 01:03:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:03:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:03:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-04 01:03:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-04 01:03:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-04 01:03:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-04 01:03:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:03:22,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:03:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:03:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:03:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:03:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-04 01:03:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:03:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:03:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-04 01:03:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-04 01:03:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-04 01:03:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-04 01:03:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:03:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:03:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-04 01:03:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-04 01:03:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-04 01:03:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:03:22,005 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:03:22,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:03:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-04 01:03:22,137 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:03:22,139 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:03:23,625 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L92: havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite72#1;havoc property_#t~mem67#1;havoc property_#t~mem66#1;havoc property_#t~mem68#1;havoc property_#t~ite71#1;havoc property_#t~mem70#1;havoc property_#t~mem69#1;havoc property_#t~mem73#1;havoc property_#t~ite80#1;havoc property_#t~mem74#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem75#1;havoc property_#t~ite77#1;havoc property_#t~mem76#1;havoc property_#t~short81#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite88#1;havoc property_#t~mem87#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~short89#1;havoc property_#t~mem90#1;havoc property_#t~ite105#1;havoc property_#t~mem100#1;havoc property_#t~mem91#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~mem94#1;havoc property_#t~ite99#1;havoc property_#t~mem95#1;havoc property_#t~ite97#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~short106#1; [2025-03-04 01:03:23,662 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-03-04 01:03:23,662 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:03:23,670 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:03:23,671 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:03:23,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:03:23 BoogieIcfgContainer [2025-03-04 01:03:23,672 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:03:23,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:03:23,673 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:03:23,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:03:23,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:03:21" (1/3) ... [2025-03-04 01:03:23,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785c4a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:03:23, skipping insertion in model container [2025-03-04 01:03:23,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:21" (2/3) ... [2025-03-04 01:03:23,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785c4a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:03:23, skipping insertion in model container [2025-03-04 01:03:23,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:03:23" (3/3) ... [2025-03-04 01:03:23,678 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-22.i [2025-03-04 01:03:23,686 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:03:23,687 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-22.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:03:23,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:03:23,726 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;@2291d5c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:03:23,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:03:23,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:03:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 01:03:23,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:23,734 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:23,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:23,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:23,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1713419575, now seen corresponding path program 1 times [2025-03-04 01:03:23,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:23,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730159648] [2025-03-04 01:03:23,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:23,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:23,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:23,748 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:03:23,749 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:03:23,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 01:03:24,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 01:03:24,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:24,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:24,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:03:24,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 01:03:24,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:24,086 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:24,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730159648] [2025-03-04 01:03:24,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730159648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:24,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:24,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:03:24,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040706623] [2025-03-04 01:03:24,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:24,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:03:24,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:24,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:03:24,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:03:24,109 INFO L87 Difference]: Start difference. First operand has 98 states, 86 states have (on average 1.441860465116279) internal successors, (124), 87 states have internal predecessors, (124), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:03:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:24,129 INFO L93 Difference]: Finished difference Result 187 states and 283 transitions. [2025-03-04 01:03:24,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:03:24,130 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-03-04 01:03:24,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:24,134 INFO L225 Difference]: With dead ends: 187 [2025-03-04 01:03:24,134 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 01:03:24,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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:03:24,137 INFO L435 NwaCegarLoop]: 129 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, 129 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:03:24,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:03:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 01:03:24,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-04 01:03:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:03:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2025-03-04 01:03:24,166 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 89 [2025-03-04 01:03:24,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:24,167 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2025-03-04 01:03:24,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:03:24,168 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2025-03-04 01:03:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 01:03:24,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:24,171 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:24,181 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:03:24,376 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:03:24,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:24,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:24,380 INFO L85 PathProgramCache]: Analyzing trace with hash 538948617, now seen corresponding path program 1 times [2025-03-04 01:03:24,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:24,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702116910] [2025-03-04 01:03:24,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:24,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:24,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:24,384 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:03:24,386 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:03:24,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 01:03:24,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 01:03:24,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:24,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:24,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:03:24,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:25,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-04 01:03:25,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2025-03-04 01:03:25,303 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 84 treesize of output 60 [2025-03-04 01:03:25,307 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 63 treesize of output 51 [2025-03-04 01:03:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:25,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:25,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:25,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702116910] [2025-03-04 01:03:25,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702116910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:25,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:25,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:03:25,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127874537] [2025-03-04 01:03:25,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:25,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:03:25,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:25,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:03:25,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:03:25,337 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:26,079 INFO L93 Difference]: Finished difference Result 493 states and 694 transitions. [2025-03-04 01:03:26,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:03:26,080 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2025-03-04 01:03:26,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:26,084 INFO L225 Difference]: With dead ends: 493 [2025-03-04 01:03:26,084 INFO L226 Difference]: Without dead ends: 404 [2025-03-04 01:03:26,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:03:26,087 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 475 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:26,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1313 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:03:26,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-04 01:03:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 351. [2025-03-04 01:03:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 310 states have (on average 1.3806451612903226) internal successors, (428), 310 states have internal predecessors, (428), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:03:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 500 transitions. [2025-03-04 01:03:26,125 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 500 transitions. Word has length 92 [2025-03-04 01:03:26,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:26,126 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 500 transitions. [2025-03-04 01:03:26,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:26,126 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 500 transitions. [2025-03-04 01:03:26,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 01:03:26,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:26,128 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:26,138 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:03:26,329 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:03:26,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:26,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:26,329 INFO L85 PathProgramCache]: Analyzing trace with hash -717069231, now seen corresponding path program 1 times [2025-03-04 01:03:26,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:26,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109510862] [2025-03-04 01:03:26,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:26,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:26,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:26,332 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:03:26,334 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:03:26,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 01:03:26,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 01:03:26,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:26,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:26,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:03:26,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:26,627 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:03:26,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-04 01:03:26,761 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:03:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:26,776 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:26,776 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:26,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109510862] [2025-03-04 01:03:26,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109510862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:26,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:26,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:03:26,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048422938] [2025-03-04 01:03:26,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:26,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:03:26,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:26,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:03:26,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:03:26,777 INFO L87 Difference]: Start difference. First operand 351 states and 500 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:27,175 INFO L93 Difference]: Finished difference Result 709 states and 999 transitions. [2025-03-04 01:03:27,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:03:27,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2025-03-04 01:03:27,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:27,177 INFO L225 Difference]: With dead ends: 709 [2025-03-04 01:03:27,178 INFO L226 Difference]: Without dead ends: 361 [2025-03-04 01:03:27,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:03:27,182 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 405 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:27,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1013 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:03:27,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-04 01:03:27,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 265. [2025-03-04 01:03:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 234 states have (on average 1.3717948717948718) internal successors, (321), 234 states have internal predecessors, (321), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:03:27,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 375 transitions. [2025-03-04 01:03:27,205 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 375 transitions. Word has length 93 [2025-03-04 01:03:27,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:27,206 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 375 transitions. [2025-03-04 01:03:27,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:27,206 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 375 transitions. [2025-03-04 01:03:27,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 01:03:27,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:27,208 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:27,217 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:03:27,408 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:03:27,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:27,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:27,409 INFO L85 PathProgramCache]: Analyzing trace with hash -194897361, now seen corresponding path program 1 times [2025-03-04 01:03:27,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:27,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950031841] [2025-03-04 01:03:27,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:27,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:27,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:27,413 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:03:27,414 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:03:27,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 01:03:27,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 01:03:27,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:27,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:27,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 01:03:27,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:27,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:27,688 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:27,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950031841] [2025-03-04 01:03:27,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950031841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:27,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:27,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:03:27,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930761401] [2025-03-04 01:03:27,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:27,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:03:27,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:27,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:03:27,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:03:27,689 INFO L87 Difference]: Start difference. First operand 265 states and 375 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:27,715 INFO L93 Difference]: Finished difference Result 541 states and 767 transitions. [2025-03-04 01:03:27,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:03:27,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2025-03-04 01:03:27,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:27,717 INFO L225 Difference]: With dead ends: 541 [2025-03-04 01:03:27,717 INFO L226 Difference]: Without dead ends: 279 [2025-03-04 01:03:27,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:03:27,718 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 20 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:27,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 248 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:03:27,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-04 01:03:27,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 195. [2025-03-04 01:03:27,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 174 states have internal predecessors, (237), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:03:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 273 transitions. [2025-03-04 01:03:27,733 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 273 transitions. Word has length 93 [2025-03-04 01:03:27,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:27,734 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 273 transitions. [2025-03-04 01:03:27,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:27,734 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 273 transitions. [2025-03-04 01:03:27,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 01:03:27,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:27,736 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:27,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:03:27,937 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:03:27,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:27,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:27,938 INFO L85 PathProgramCache]: Analyzing trace with hash -541476921, now seen corresponding path program 1 times [2025-03-04 01:03:27,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:27,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945582855] [2025-03-04 01:03:27,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:27,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:27,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:27,941 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:03:27,942 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:03:28,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 01:03:28,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 01:03:28,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:28,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:28,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:03:28,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:28,234 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:03:28,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-04 01:03:28,458 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 51 treesize of output 33 [2025-03-04 01:03:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:28,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:28,488 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:28,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945582855] [2025-03-04 01:03:28,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945582855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:28,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:28,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:03:28,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992346860] [2025-03-04 01:03:28,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:28,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:03:28,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:28,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:03:28,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:03:28,489 INFO L87 Difference]: Start difference. First operand 195 states and 273 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:28,869 INFO L93 Difference]: Finished difference Result 363 states and 502 transitions. [2025-03-04 01:03:28,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:03:28,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2025-03-04 01:03:28,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:28,871 INFO L225 Difference]: With dead ends: 363 [2025-03-04 01:03:28,871 INFO L226 Difference]: Without dead ends: 274 [2025-03-04 01:03:28,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:03:28,872 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 285 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:28,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 919 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:03:28,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-04 01:03:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 203. [2025-03-04 01:03:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:03:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 284 transitions. [2025-03-04 01:03:28,879 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 284 transitions. Word has length 94 [2025-03-04 01:03:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:28,879 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 284 transitions. [2025-03-04 01:03:28,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 284 transitions. [2025-03-04 01:03:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 01:03:28,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:28,880 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:28,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-04 01:03:29,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:29,080 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:29,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:29,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1509445164, now seen corresponding path program 1 times [2025-03-04 01:03:29,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:29,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113341235] [2025-03-04 01:03:29,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:29,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:29,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:29,083 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:03:29,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:03:29,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 01:03:29,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 01:03:29,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:29,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:29,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:03:29,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:29,365 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:03:29,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-04 01:03:29,519 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:03:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:29,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:29,532 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:29,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113341235] [2025-03-04 01:03:29,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113341235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:29,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:29,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:03:29,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271852566] [2025-03-04 01:03:29,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:29,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:03:29,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:29,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:03:29,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:03:29,534 INFO L87 Difference]: Start difference. First operand 203 states and 284 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:29,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:29,870 INFO L93 Difference]: Finished difference Result 410 states and 568 transitions. [2025-03-04 01:03:29,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:03:29,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2025-03-04 01:03:29,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:29,872 INFO L225 Difference]: With dead ends: 410 [2025-03-04 01:03:29,872 INFO L226 Difference]: Without dead ends: 313 [2025-03-04 01:03:29,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:03:29,872 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 328 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:29,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 949 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:03:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-04 01:03:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 199. [2025-03-04 01:03:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 178 states have (on average 1.353932584269663) internal successors, (241), 178 states have internal predecessors, (241), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:03:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 277 transitions. [2025-03-04 01:03:29,890 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 277 transitions. Word has length 94 [2025-03-04 01:03:29,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:29,891 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 277 transitions. [2025-03-04 01:03:29,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:29,891 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 277 transitions. [2025-03-04 01:03:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 01:03:29,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:29,891 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:29,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-04 01:03:30,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:30,092 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:30,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:30,092 INFO L85 PathProgramCache]: Analyzing trace with hash -746100851, now seen corresponding path program 1 times [2025-03-04 01:03:30,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:30,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473920179] [2025-03-04 01:03:30,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:30,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:30,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:30,095 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:03:30,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:03:30,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 01:03:30,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 01:03:30,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:30,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:30,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:03:30,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:30,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 01:03:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-04 01:03:30,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:30,822 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 23 treesize of output 15 [2025-03-04 01:03:30,884 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:30,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473920179] [2025-03-04 01:03:30,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473920179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:30,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1874447411] [2025-03-04 01:03:30,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:30,884 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:03:30,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:03:30,887 INFO L229 MonitoredProcess]: Starting monitored process 9 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:03:30,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-04 01:03:31,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 01:03:31,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 01:03:31,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:31,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:31,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:03:31,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:31,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-04 01:03:31,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2025-03-04 01:03:31,694 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 82 treesize of output 58 [2025-03-04 01:03:31,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2025-03-04 01:03:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:31,736 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:31,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1874447411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:31,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:03:31,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2025-03-04 01:03:31,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011437745] [2025-03-04 01:03:31,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:31,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:03:31,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:31,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:03:31,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:03:31,738 INFO L87 Difference]: Start difference. First operand 199 states and 277 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:32,545 INFO L93 Difference]: Finished difference Result 701 states and 978 transitions. [2025-03-04 01:03:32,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:03:32,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2025-03-04 01:03:32,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:32,548 INFO L225 Difference]: With dead ends: 701 [2025-03-04 01:03:32,548 INFO L226 Difference]: Without dead ends: 612 [2025-03-04 01:03:32,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:03:32,549 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 384 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:32,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1713 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:03:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-03-04 01:03:32,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 259. [2025-03-04 01:03:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 228 states have (on average 1.3508771929824561) internal successors, (308), 228 states have internal predecessors, (308), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:03:32,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 362 transitions. [2025-03-04 01:03:32,568 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 362 transitions. Word has length 95 [2025-03-04 01:03:32,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:32,568 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 362 transitions. [2025-03-04 01:03:32,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 362 transitions. [2025-03-04 01:03:32,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 01:03:32,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:32,569 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:32,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2025-03-04 01:03:32,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-04 01:03:32,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:32,970 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:32,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:32,970 INFO L85 PathProgramCache]: Analyzing trace with hash -813107604, now seen corresponding path program 1 times [2025-03-04 01:03:32,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:32,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46487000] [2025-03-04 01:03:32,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:32,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:32,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:32,972 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:03:32,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-04 01:03:33,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 01:03:33,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 01:03:33,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:33,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:33,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:03:33,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:33,232 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 9 treesize of output 3 [2025-03-04 01:03:33,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 01:03:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-04 01:03:33,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:33,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-03-04 01:03:33,943 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:33,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46487000] [2025-03-04 01:03:33,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46487000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:33,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1174754279] [2025-03-04 01:03:33,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:33,944 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:03:33,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:03:33,946 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:03:33,947 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:03:34,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 01:03:34,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 01:03:34,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:34,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:34,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 01:03:34,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:35,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2025-03-04 01:03:35,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2025-03-04 01:03:35,225 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 66 treesize of output 54 [2025-03-04 01:03:35,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:35,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 59 [2025-03-04 01:03:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-04 01:03:35,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:03:35,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1174754279] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:35,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:03:35,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 11] total 22 [2025-03-04 01:03:35,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037806773] [2025-03-04 01:03:35,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:35,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:03:35,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:35,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:03:35,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:03:35,392 INFO L87 Difference]: Start difference. First operand 259 states and 362 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:35,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:35,576 INFO L93 Difference]: Finished difference Result 436 states and 610 transitions. [2025-03-04 01:03:35,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:03:35,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2025-03-04 01:03:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:35,577 INFO L225 Difference]: With dead ends: 436 [2025-03-04 01:03:35,577 INFO L226 Difference]: Without dead ends: 347 [2025-03-04 01:03:35,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:03:35,578 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 110 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:35,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 588 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:03:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-04 01:03:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 213. [2025-03-04 01:03:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 192 states have (on average 1.3541666666666667) internal successors, (260), 192 states have internal predecessors, (260), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:03:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 296 transitions. [2025-03-04 01:03:35,585 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 296 transitions. Word has length 95 [2025-03-04 01:03:35,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:35,586 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 296 transitions. [2025-03-04 01:03:35,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:03:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 296 transitions. [2025-03-04 01:03:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 01:03:35,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:35,586 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:35,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2025-03-04 01:03:35,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2025-03-04 01:03:35,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:35,987 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:35,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:35,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1656183035, now seen corresponding path program 1 times [2025-03-04 01:03:35,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:35,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080087356] [2025-03-04 01:03:35,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:35,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:35,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:35,991 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:03:35,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-04 01:03:36,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:03:36,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:03:36,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:36,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:36,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:03:36,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:36,309 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 9 treesize of output 3 [2025-03-04 01:03:36,520 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 15 treesize of output 7 [2025-03-04 01:03:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-04 01:03:36,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:36,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-03-04 01:03:36,933 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:36,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080087356] [2025-03-04 01:03:36,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080087356] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:36,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1044123665] [2025-03-04 01:03:36,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:36,934 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:03:36,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:03:36,935 INFO L229 MonitoredProcess]: Starting monitored process 13 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:03:36,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2025-03-04 01:03:37,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:03:37,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:03:37,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:37,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:37,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:03:37,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:37,999 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 9 treesize of output 3 [2025-03-04 01:03:38,133 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 15 treesize of output 7 [2025-03-04 01:03:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-04 01:03:38,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:38,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-03-04 01:03:38,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1044123665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:38,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:03:38,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-04 01:03:38,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347209818] [2025-03-04 01:03:38,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:03:38,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:03:38,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:38,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:03:38,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:03:38,422 INFO L87 Difference]: Start difference. First operand 213 states and 296 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:03:38,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:38,868 INFO L93 Difference]: Finished difference Result 602 states and 833 transitions. [2025-03-04 01:03:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:03:38,872 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 96 [2025-03-04 01:03:38,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:38,873 INFO L225 Difference]: With dead ends: 602 [2025-03-04 01:03:38,873 INFO L226 Difference]: Without dead ends: 392 [2025-03-04 01:03:38,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:03:38,874 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 241 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:38,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 718 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:03:38,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-04 01:03:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 286. [2025-03-04 01:03:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 254 states have (on average 1.3346456692913387) internal successors, (339), 254 states have internal predecessors, (339), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:03:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 393 transitions. [2025-03-04 01:03:38,884 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 393 transitions. Word has length 96 [2025-03-04 01:03:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:38,885 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 393 transitions. [2025-03-04 01:03:38,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:03:38,885 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 393 transitions. [2025-03-04 01:03:38,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 01:03:38,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:38,885 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:38,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2025-03-04 01:03:39,098 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 (12)] Forceful destruction successful, exit code 0 [2025-03-04 01:03:39,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:39,286 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:39,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:39,286 INFO L85 PathProgramCache]: Analyzing trace with hash 600727972, now seen corresponding path program 1 times [2025-03-04 01:03:39,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:39,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430895786] [2025-03-04 01:03:39,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:39,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:39,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:39,289 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:03:39,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-03-04 01:03:39,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:03:39,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:03:39,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:39,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:39,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:03:39,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:39,618 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 9 treesize of output 3 [2025-03-04 01:03:39,806 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 15 treesize of output 7 [2025-03-04 01:03:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-04 01:03:39,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:39,912 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:39,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430895786] [2025-03-04 01:03:39,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430895786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:39,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [501499863] [2025-03-04 01:03:39,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:39,912 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:03:39,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:03:39,914 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:03:39,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2025-03-04 01:03:40,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 01:03:40,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 01:03:40,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:40,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:40,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:03:40,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:40,971 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 9 treesize of output 3 [2025-03-04 01:03:41,124 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 15 treesize of output 7 [2025-03-04 01:03:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-04 01:03:41,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:41,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [501499863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:41,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:03:41,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-03-04 01:03:41,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423557660] [2025-03-04 01:03:41,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:03:41,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:03:41,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:41,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:03:41,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:03:41,195 INFO L87 Difference]: Start difference. First operand 286 states and 393 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:03:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:41,801 INFO L93 Difference]: Finished difference Result 602 states and 829 transitions. [2025-03-04 01:03:41,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:03:41,801 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 96 [2025-03-04 01:03:41,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:41,803 INFO L225 Difference]: With dead ends: 602 [2025-03-04 01:03:41,803 INFO L226 Difference]: Without dead ends: 392 [2025-03-04 01:03:41,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:03:41,804 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 156 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:41,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 817 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:03:41,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-04 01:03:41,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 286. [2025-03-04 01:03:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 254 states have (on average 1.3346456692913387) internal successors, (339), 254 states have internal predecessors, (339), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:03:41,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 393 transitions. [2025-03-04 01:03:41,817 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 393 transitions. Word has length 96 [2025-03-04 01:03:41,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:41,817 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 393 transitions. [2025-03-04 01:03:41,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 01:03:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 393 transitions. [2025-03-04 01:03:41,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 01:03:41,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:41,818 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:41,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2025-03-04 01:03:42,029 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 (14)] Ended with exit code 0 [2025-03-04 01:03:42,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:42,219 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:42,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:42,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1409020985, now seen corresponding path program 1 times [2025-03-04 01:03:42,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:42,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369452907] [2025-03-04 01:03:42,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:42,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:42,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:42,221 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:03:42,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-03-04 01:03:42,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes.