./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.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-25.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 153786ff23d1f4ad1fa22216334d8f153d923a58dff5067a8f60a9c72819150b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:03:48,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:03:48,063 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:48,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:03:48,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:03:48,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:03:48,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:03:48,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:03:48,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:03:48,091 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:03:48,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:03:48,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:03:48,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:03:48,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:03:48,092 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:03:48,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:03:48,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:03:48,093 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:03:48,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:03:48,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:03:48,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:03:48,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:03:48,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:03:48,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:03:48,093 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:03:48,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:03:48,093 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:03:48,093 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:03:48,093 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:03:48,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:03:48,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:03:48,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:03:48,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:03:48,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:03:48,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:03:48,095 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:03:48,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:03:48,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:03:48,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:03:48,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:03:48,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:03:48,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:03:48,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:03:48,095 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 -> 153786ff23d1f4ad1fa22216334d8f153d923a58dff5067a8f60a9c72819150b [2025-03-04 01:03:48,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:03:48,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:03:48,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:03:48,319 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:03:48,319 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:03:48,321 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-25.i [2025-03-04 01:03:49,483 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267fea62e/b1477a8f4f52454eb16f3f035903ab56/FLAG44826de02 [2025-03-04 01:03:49,719 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:03:49,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-25.i [2025-03-04 01:03:49,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267fea62e/b1477a8f4f52454eb16f3f035903ab56/FLAG44826de02 [2025-03-04 01:03:50,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267fea62e/b1477a8f4f52454eb16f3f035903ab56 [2025-03-04 01:03:50,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:03:50,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:03:50,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:03:50,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:03:50,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:03:50,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:03:50" (1/1) ... [2025-03-04 01:03:50,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b3beda0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:50, skipping insertion in model container [2025-03-04 01:03:50,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:03:50" (1/1) ... [2025-03-04 01:03:50,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:03:50,206 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-25.i[916,929] [2025-03-04 01:03:50,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:03:50,291 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:03:50,299 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-25.i[916,929] [2025-03-04 01:03:50,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:03:50,357 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:03:50,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:50 WrapperNode [2025-03-04 01:03:50,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:03:50,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:03:50,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:03:50,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:03:50,363 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:50" (1/1) ... [2025-03-04 01:03:50,373 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:50" (1/1) ... [2025-03-04 01:03:50,402 INFO L138 Inliner]: procedures = 29, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 555 [2025-03-04 01:03:50,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:03:50,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:03:50,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:03:50,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:03:50,414 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:50" (1/1) ... [2025-03-04 01:03:50,414 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:50" (1/1) ... [2025-03-04 01:03:50,423 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:50" (1/1) ... [2025-03-04 01:03:50,443 INFO L175 MemorySlicer]: Split 146 memory accesses to 5 slices as follows [2, 33, 56, 35, 20]. 38 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 4, 4, 2]. The 19 writes are split as follows [0, 6, 6, 5, 2]. [2025-03-04 01:03:50,443 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:50" (1/1) ... [2025-03-04 01:03:50,443 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:50" (1/1) ... [2025-03-04 01:03:50,463 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:50" (1/1) ... [2025-03-04 01:03:50,465 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:50" (1/1) ... [2025-03-04 01:03:50,466 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:50" (1/1) ... [2025-03-04 01:03:50,468 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:50" (1/1) ... [2025-03-04 01:03:50,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:03:50,472 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:03:50,472 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:03:50,472 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:03:50,473 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:50" (1/1) ... [2025-03-04 01:03:50,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:03:50,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:03:50,505 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:50,512 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:50,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:03:50,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:03:50,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:03:50,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:03:50,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:03:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:03:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:03:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:03:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:03:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:03:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:03:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:03:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:03:50,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:03:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:03:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:03:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:03:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:03:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:03:50,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:03:50,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:03:50,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:03:50,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:03:50,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:03:50,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:03:50,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:03:50,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:03:50,534 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:03:50,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:03:50,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:03:50,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:03:50,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:03:50,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:03:50,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:03:50,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:03:50,671 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:03:50,672 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:03:51,106 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem91#1;havoc property_#t~ite107#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem103#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite120#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~mem119#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short121#1;havoc property_#t~mem131#1;havoc property_#t~mem122#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem125#1;havoc property_#t~ite130#1;havoc property_#t~mem126#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem129#1;havoc property_#t~ite139#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~ite138#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short140#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite155#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~short145#1;havoc property_#t~ite152#1;havoc property_#t~mem149#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~short148#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~mem154#1;havoc property_#t~mem153#1;havoc property_#t~short156#1; [2025-03-04 01:03:51,150 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2025-03-04 01:03:51,150 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:03:51,161 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:03:51,163 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:03:51,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:03:51 BoogieIcfgContainer [2025-03-04 01:03:51,164 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:03:51,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:03:51,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:03:51,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:03:51,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:03:50" (1/3) ... [2025-03-04 01:03:51,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c93ec59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:03:51, skipping insertion in model container [2025-03-04 01:03:51,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:03:50" (2/3) ... [2025-03-04 01:03:51,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c93ec59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:03:51, skipping insertion in model container [2025-03-04 01:03:51,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:03:51" (3/3) ... [2025-03-04 01:03:51,172 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-25.i [2025-03-04 01:03:51,184 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:03:51,185 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-25.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:03:51,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:03:51,239 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;@6d26b2c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:03:51,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:03:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:03:51,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:03:51,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:51,253 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:51,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:51,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:51,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1236225805, now seen corresponding path program 1 times [2025-03-04 01:03:51,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:51,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595641814] [2025-03-04 01:03:51,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:51,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:51,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:03:51,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:03:51,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:51,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 01:03:51,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:51,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595641814] [2025-03-04 01:03:51,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595641814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:51,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915537849] [2025-03-04 01:03:51,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:51,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:51,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:03:51,511 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:51,512 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:51,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:03:51,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:03:51,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:51,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:51,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:03:51,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 01:03:51,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:51,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915537849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:51,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:03:51,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:03:51,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351428786] [2025-03-04 01:03:51,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:51,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:03:51,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:51,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:03:51,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:03:51,754 INFO L87 Difference]: Start difference. First operand has 123 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:03:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:51,783 INFO L93 Difference]: Finished difference Result 240 states and 375 transitions. [2025-03-04 01:03:51,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:03:51,786 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2025-03-04 01:03:51,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:51,791 INFO L225 Difference]: With dead ends: 240 [2025-03-04 01:03:51,792 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 01:03:51,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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:51,797 INFO L435 NwaCegarLoop]: 176 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, 176 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:51,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 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:51,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 01:03:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-04 01:03:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:03:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-03-04 01:03:51,828 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 144 [2025-03-04 01:03:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:51,829 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-03-04 01:03:51,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:03:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-03-04 01:03:51,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 01:03:51,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:51,831 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:51,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:03:52,031 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:52,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:52,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:52,032 INFO L85 PathProgramCache]: Analyzing trace with hash 763660477, now seen corresponding path program 1 times [2025-03-04 01:03:52,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:52,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459406287] [2025-03-04 01:03:52,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:52,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:52,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 01:03:52,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 01:03:52,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:52,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:03:53,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:53,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459406287] [2025-03-04 01:03:53,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459406287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:53,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:53,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:03:53,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792688740] [2025-03-04 01:03:53,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:53,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:03:53,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:53,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:03:53,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:03:53,797 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:03:54,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:54,117 INFO L93 Difference]: Finished difference Result 355 states and 519 transitions. [2025-03-04 01:03:54,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:03:54,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2025-03-04 01:03:54,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:54,121 INFO L225 Difference]: With dead ends: 355 [2025-03-04 01:03:54,121 INFO L226 Difference]: Without dead ends: 238 [2025-03-04 01:03:54,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:03:54,123 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 227 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:54,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1303 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:03:54,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-04 01:03:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 203. [2025-03-04 01:03:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 174 states have (on average 1.4080459770114941) internal successors, (245), 175 states have internal predecessors, (245), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:03:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 297 transitions. [2025-03-04 01:03:54,146 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 297 transitions. Word has length 144 [2025-03-04 01:03:54,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:54,146 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 297 transitions. [2025-03-04 01:03:54,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 01:03:54,147 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 297 transitions. [2025-03-04 01:03:54,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 01:03:54,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:54,148 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:54,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:03:54,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:54,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:54,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1613598771, now seen corresponding path program 1 times [2025-03-04 01:03:54,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:54,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816795151] [2025-03-04 01:03:54,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:54,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:54,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 01:03:54,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 01:03:54,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:54,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:03:54,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:54,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816795151] [2025-03-04 01:03:54,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816795151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:54,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:54,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:03:54,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148112512] [2025-03-04 01:03:54,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:54,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:03:54,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:54,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:03:54,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:03:54,408 INFO L87 Difference]: Start difference. First operand 203 states and 297 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:03:54,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:54,620 INFO L93 Difference]: Finished difference Result 467 states and 680 transitions. [2025-03-04 01:03:54,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:03:54,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-04 01:03:54,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:54,623 INFO L225 Difference]: With dead ends: 467 [2025-03-04 01:03:54,623 INFO L226 Difference]: Without dead ends: 267 [2025-03-04 01:03:54,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:03:54,628 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 155 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:54,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 772 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:03:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-04 01:03:54,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 258. [2025-03-04 01:03:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 209 states have (on average 1.3636363636363635) internal successors, (285), 211 states have internal predecessors, (285), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:03:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 373 transitions. [2025-03-04 01:03:54,662 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 373 transitions. Word has length 145 [2025-03-04 01:03:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:54,663 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 373 transitions. [2025-03-04 01:03:54,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:03:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 373 transitions. [2025-03-04 01:03:54,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 01:03:54,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:54,665 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:54,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:03:54,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:54,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:54,668 INFO L85 PathProgramCache]: Analyzing trace with hash 815897495, now seen corresponding path program 1 times [2025-03-04 01:03:54,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:54,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722026097] [2025-03-04 01:03:54,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:54,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:54,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:03:54,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:03:54,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:54,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:54,836 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-04 01:03:54,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:54,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722026097] [2025-03-04 01:03:54,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722026097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:54,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587164731] [2025-03-04 01:03:54,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:54,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:54,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:03:54,840 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:54,841 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:54,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 01:03:55,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 01:03:55,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:55,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:55,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:03:55,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:03:55,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:55,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587164731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:55,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:03:55,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:03:55,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421754351] [2025-03-04 01:03:55,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:55,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:03:55,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:55,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:03:55,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:03:55,062 INFO L87 Difference]: Start difference. First operand 258 states and 373 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:03:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:55,102 INFO L93 Difference]: Finished difference Result 488 states and 707 transitions. [2025-03-04 01:03:55,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:03:55,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2025-03-04 01:03:55,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:55,107 INFO L225 Difference]: With dead ends: 488 [2025-03-04 01:03:55,107 INFO L226 Difference]: Without dead ends: 264 [2025-03-04 01:03:55,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 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:55,108 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:55,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 682 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:03:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-04 01:03:55,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2025-03-04 01:03:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 213 states have (on average 1.3568075117370892) internal successors, (289), 215 states have internal predecessors, (289), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:03:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 377 transitions. [2025-03-04 01:03:55,126 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 377 transitions. Word has length 146 [2025-03-04 01:03:55,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:55,126 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 377 transitions. [2025-03-04 01:03:55,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:03:55,126 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 377 transitions. [2025-03-04 01:03:55,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:03:55,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:55,128 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:55,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:03:55,328 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,SelfDestructingSolverStorable3 [2025-03-04 01:03:55,329 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:55,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1414917031, now seen corresponding path program 1 times [2025-03-04 01:03:55,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:55,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580908353] [2025-03-04 01:03:55,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:55,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:03:55,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:03:55,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:55,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:03:55,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:55,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580908353] [2025-03-04 01:03:55,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580908353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:55,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:55,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:03:55,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724996524] [2025-03-04 01:03:55,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:55,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:03:55,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:55,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:03:55,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:03:55,552 INFO L87 Difference]: Start difference. First operand 262 states and 377 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:03:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:55,765 INFO L93 Difference]: Finished difference Result 492 states and 709 transitions. [2025-03-04 01:03:55,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:03:55,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2025-03-04 01:03:55,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:55,768 INFO L225 Difference]: With dead ends: 492 [2025-03-04 01:03:55,768 INFO L226 Difference]: Without dead ends: 264 [2025-03-04 01:03:55,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:03:55,769 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 138 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:55,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 809 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:03:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-04 01:03:55,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 255. [2025-03-04 01:03:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 206 states have (on average 1.3495145631067962) internal successors, (278), 208 states have internal predecessors, (278), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:03:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 366 transitions. [2025-03-04 01:03:55,794 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 366 transitions. Word has length 148 [2025-03-04 01:03:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:55,794 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 366 transitions. [2025-03-04 01:03:55,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:03:55,794 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 366 transitions. [2025-03-04 01:03:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-04 01:03:55,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:55,796 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:55,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:03:55,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:55,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2014781223, now seen corresponding path program 1 times [2025-03-04 01:03:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:55,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486580794] [2025-03-04 01:03:55,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:55,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:03:55,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:03:55,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:55,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-04 01:03:56,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:56,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486580794] [2025-03-04 01:03:56,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486580794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:56,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363363177] [2025-03-04 01:03:56,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:56,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:56,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:03:56,358 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:56,360 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:56,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 01:03:56,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 01:03:56,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:56,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:56,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 01:03:56,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:56,621 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 33 treesize of output 17 [2025-03-04 01:03:56,852 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 31 treesize of output 24 [2025-03-04 01:03:56,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:56,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2025-03-04 01:03:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 141 proven. 45 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2025-03-04 01:03:56,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-04 01:03:57,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363363177] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:03:57,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:03:57,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2025-03-04 01:03:57,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160744433] [2025-03-04 01:03:57,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:03:57,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:03:57,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:57,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:03:57,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:03:57,182 INFO L87 Difference]: Start difference. First operand 255 states and 366 transitions. Second operand has 13 states, 10 states have (on average 7.4) internal successors, (74), 13 states have internal predecessors, (74), 5 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 5 states have call successors, (35) [2025-03-04 01:03:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:57,804 INFO L93 Difference]: Finished difference Result 634 states and 892 transitions. [2025-03-04 01:03:57,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-04 01:03:57,805 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 7.4) internal successors, (74), 13 states have internal predecessors, (74), 5 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 5 states have call successors, (35) Word has length 148 [2025-03-04 01:03:57,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:57,807 INFO L225 Difference]: With dead ends: 634 [2025-03-04 01:03:57,808 INFO L226 Difference]: Without dead ends: 413 [2025-03-04 01:03:57,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 290 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2025-03-04 01:03:57,812 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 450 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:57,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 877 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:03:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-04 01:03:57,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 390. [2025-03-04 01:03:57,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 316 states have (on average 1.3354430379746836) internal successors, (422), 319 states have internal predecessors, (422), 62 states have call successors, (62), 11 states have call predecessors, (62), 11 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:03:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 546 transitions. [2025-03-04 01:03:57,843 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 546 transitions. Word has length 148 [2025-03-04 01:03:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:57,843 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 546 transitions. [2025-03-04 01:03:57,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 7.4) internal successors, (74), 13 states have internal predecessors, (74), 5 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 5 states have call successors, (35) [2025-03-04 01:03:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 546 transitions. [2025-03-04 01:03:57,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 01:03:57,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:57,845 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:57,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:03:58,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:58,046 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:58,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:58,046 INFO L85 PathProgramCache]: Analyzing trace with hash -410127511, now seen corresponding path program 1 times [2025-03-04 01:03:58,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:58,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213434119] [2025-03-04 01:03:58,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:58,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:58,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 01:03:58,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 01:03:58,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:58,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-04 01:03:58,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:58,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213434119] [2025-03-04 01:03:58,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213434119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:58,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:58,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:03:58,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476155085] [2025-03-04 01:03:58,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:58,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:03:58,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:58,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:03:58,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:03:58,345 INFO L87 Difference]: Start difference. First operand 390 states and 546 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:03:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:58,485 INFO L93 Difference]: Finished difference Result 940 states and 1323 transitions. [2025-03-04 01:03:58,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:03:58,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-03-04 01:03:58,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:58,489 INFO L225 Difference]: With dead ends: 940 [2025-03-04 01:03:58,489 INFO L226 Difference]: Without dead ends: 592 [2025-03-04 01:03:58,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:03:58,493 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 145 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:58,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 998 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:03:58,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-04 01:03:58,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 588. [2025-03-04 01:03:58,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 481 states have (on average 1.340956340956341) internal successors, (645), 486 states have internal predecessors, (645), 90 states have call successors, (90), 16 states have call predecessors, (90), 16 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 01:03:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 825 transitions. [2025-03-04 01:03:58,547 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 825 transitions. Word has length 149 [2025-03-04 01:03:58,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:58,548 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 825 transitions. [2025-03-04 01:03:58,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 01:03:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 825 transitions. [2025-03-04 01:03:58,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-04 01:03:58,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:58,550 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:58,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:03:58,551 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:58,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:58,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2138643605, now seen corresponding path program 1 times [2025-03-04 01:03:58,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:58,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686763860] [2025-03-04 01:03:58,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:58,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:58,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-04 01:03:58,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-04 01:03:58,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:58,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat