./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_fib-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/seq-pthread/cs_fib-1.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 da5783328d73eba8f05689c8b63c9b7f7c1c1eeab4600bb7173d3ddf64fb59e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:42:08,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:42:08,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:42:08,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:42:08,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:42:08,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:42:08,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:42:08,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:42:08,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:42:08,225 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:42:08,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:42:08,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:42:08,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:42:08,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:42:08,226 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:42:08,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:42:08,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:42:08,226 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:42:08,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:42:08,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:42:08,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:42:08,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:42:08,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:42:08,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:42:08,226 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:42:08,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:42:08,226 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:42:08,226 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:42:08,226 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:42:08,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:42:08,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:42:08,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:42:08,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:42:08,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:42:08,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:42:08,227 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:42:08,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:42:08,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:42:08,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:42:08,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:42:08,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:42:08,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:42:08,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:42:08,227 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 -> da5783328d73eba8f05689c8b63c9b7f7c1c1eeab4600bb7173d3ddf64fb59e0 [2025-03-16 19:42:08,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:42:08,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:42:08,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:42:08,492 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:42:08,493 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:42:08,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_fib-1.i [2025-03-16 19:42:09,675 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c142819d0/ee29dc491b8741409b5c5938e99272f0/FLAGca8eb421a [2025-03-16 19:42:10,008 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:42:10,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_fib-1.i [2025-03-16 19:42:10,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c142819d0/ee29dc491b8741409b5c5938e99272f0/FLAGca8eb421a [2025-03-16 19:42:10,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c142819d0/ee29dc491b8741409b5c5938e99272f0 [2025-03-16 19:42:10,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:42:10,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:42:10,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:42:10,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:42:10,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:42:10,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:42:10" (1/1) ... [2025-03-16 19:42:10,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fe6fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:10, skipping insertion in model container [2025-03-16 19:42:10,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:42:10" (1/1) ... [2025-03-16 19:42:10,086 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:42:10,320 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/seq-pthread/cs_fib-1.i[23602,23615] [2025-03-16 19:42:10,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:42:10,414 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:42:10,434 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/seq-pthread/cs_fib-1.i[23602,23615] [2025-03-16 19:42:10,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:42:10,513 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:42:10,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:10 WrapperNode [2025-03-16 19:42:10,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:42:10,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:42:10,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:42:10,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:42:10,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:10" (1/1) ... [2025-03-16 19:42:10,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:10" (1/1) ... [2025-03-16 19:42:10,569 INFO L138 Inliner]: procedures = 145, calls = 397, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 704 [2025-03-16 19:42:10,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:42:10,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:42:10,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:42:10,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:42:10,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:10" (1/1) ... [2025-03-16 19:42:10,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:10" (1/1) ... [2025-03-16 19:42:10,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:10" (1/1) ... [2025-03-16 19:42:10,627 INFO L175 MemorySlicer]: Split 269 memory accesses to 15 slices as follows [2, 31, 8, 8, 8, 53, 48, 22, 22, 10, 11, 0, 4, 11, 31]. 20 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 0, 3, 3, 3, 18, 18, 6, 6, 6, 0, 0, 2, 0, 0]. The 63 writes are split as follows [0, 1, 2, 2, 2, 20, 15, 7, 7, 2, 1, 0, 2, 1, 1]. [2025-03-16 19:42:10,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:10" (1/1) ... [2025-03-16 19:42:10,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:10" (1/1) ... [2025-03-16 19:42:10,666 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:10" (1/1) ... [2025-03-16 19:42:10,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:10" (1/1) ... [2025-03-16 19:42:10,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:10" (1/1) ... [2025-03-16 19:42:10,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:10" (1/1) ... [2025-03-16 19:42:10,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:42:10,699 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:42:10,700 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:42:10,701 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:42:10,701 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:10" (1/1) ... [2025-03-16 19:42:10,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:42:10,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:10,730 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-16 19:42:10,733 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-16 19:42:10,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-16 19:42:10,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-16 19:42:10,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-16 19:42:10,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-16 19:42:10,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-16 19:42:10,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-16 19:42:10,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-16 19:42:10,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-16 19:42:10,756 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 19:42:10,756 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 19:42:10,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:42:10,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 19:42:10,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 19:42:10,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 19:42:10,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 19:42:10,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-16 19:42:10,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-16 19:42:10,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-16 19:42:10,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-16 19:42:10,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-16 19:42:10,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-16 19:42:10,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-16 19:42:10,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-16 19:42:10,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-16 19:42:10,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-16 19:42:10,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-16 19:42:10,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-16 19:42:10,758 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-16 19:42:10,758 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-16 19:42:10,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 19:42:10,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 19:42:10,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 19:42:10,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-16 19:42:10,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-16 19:42:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-16 19:42:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-16 19:42:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-16 19:42:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-16 19:42:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-16 19:42:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-16 19:42:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-16 19:42:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-16 19:42:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-16 19:42:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-16 19:42:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:42:10,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:42:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 19:42:10,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-16 19:42:10,761 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 19:42:10,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 19:42:10,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:42:10,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:42:10,971 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:42:10,973 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:42:11,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-16 19:42:11,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:11,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:11,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-16 19:42:11,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:11,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:11,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-16 19:42:11,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:11,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:15,680 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-16 19:42:15,680 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:42:15,692 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:42:15,694 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:42:15,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:42:15 BoogieIcfgContainer [2025-03-16 19:42:15,694 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:42:15,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:42:15,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:42:15,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:42:15,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:42:10" (1/3) ... [2025-03-16 19:42:15,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc20f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:42:15, skipping insertion in model container [2025-03-16 19:42:15,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:10" (2/3) ... [2025-03-16 19:42:15,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc20f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:42:15, skipping insertion in model container [2025-03-16 19:42:15,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:42:15" (3/3) ... [2025-03-16 19:42:15,703 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_fib-1.i [2025-03-16 19:42:15,716 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:42:15,718 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_fib-1.i that has 5 procedures, 165 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-16 19:42:15,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:42:15,777 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;@2355f2db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:42:15,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:42:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 100 states have (on average 1.33) internal successors, (133), 101 states have internal predecessors, (133), 59 states have call successors, (59), 4 states have call predecessors, (59), 4 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-16 19:42:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-16 19:42:15,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:15,823 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:42:15,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:15,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:15,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2105265810, now seen corresponding path program 1 times [2025-03-16 19:42:15,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:15,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825752925] [2025-03-16 19:42:15,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:15,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:16,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-16 19:42:16,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-16 19:42:16,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:16,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-16 19:42:16,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:16,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825752925] [2025-03-16 19:42:16,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825752925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:16,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:16,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:42:16,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743548090] [2025-03-16 19:42:16,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:16,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:42:16,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:16,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:42:16,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:16,770 INFO L87 Difference]: Start difference. First operand has 165 states, 100 states have (on average 1.33) internal successors, (133), 101 states have internal predecessors, (133), 59 states have call successors, (59), 4 states have call predecessors, (59), 4 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 19:42:20,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:42:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:20,888 INFO L93 Difference]: Finished difference Result 329 states and 558 transitions. [2025-03-16 19:42:20,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:42:20,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 250 [2025-03-16 19:42:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:20,895 INFO L225 Difference]: With dead ends: 329 [2025-03-16 19:42:20,895 INFO L226 Difference]: Without dead ends: 164 [2025-03-16 19:42:20,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:20,904 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 2 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:20,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 489 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 19:42:20,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-16 19:42:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2025-03-16 19:42:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 99 states have (on average 1.303030303030303) internal successors, (129), 99 states have internal predecessors, (129), 59 states have call successors, (59), 4 states have call predecessors, (59), 4 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-16 19:42:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 247 transitions. [2025-03-16 19:42:20,963 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 247 transitions. Word has length 250 [2025-03-16 19:42:20,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:20,964 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 247 transitions. [2025-03-16 19:42:20,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 19:42:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 247 transitions. [2025-03-16 19:42:20,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-16 19:42:20,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:20,969 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:42:20,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:42:20,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:20,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:20,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1146366228, now seen corresponding path program 1 times [2025-03-16 19:42:20,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:20,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131160112] [2025-03-16 19:42:20,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:20,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:21,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-16 19:42:21,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-16 19:42:21,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:21,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3121 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-16 19:42:21,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:21,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131160112] [2025-03-16 19:42:21,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131160112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:21,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:21,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:42:21,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621676495] [2025-03-16 19:42:21,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:21,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:42:21,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:21,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:42:21,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:21,502 INFO L87 Difference]: Start difference. First operand 163 states and 247 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 19:42:21,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:21,561 INFO L93 Difference]: Finished difference Result 325 states and 494 transitions. [2025-03-16 19:42:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:42:21,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 252 [2025-03-16 19:42:21,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:21,564 INFO L225 Difference]: With dead ends: 325 [2025-03-16 19:42:21,564 INFO L226 Difference]: Without dead ends: 164 [2025-03-16 19:42:21,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:21,565 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:21,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:21,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-16 19:42:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-16 19:42:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 100 states have (on average 1.3) internal successors, (130), 100 states have internal predecessors, (130), 59 states have call successors, (59), 4 states have call predecessors, (59), 4 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-16 19:42:21,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 248 transitions. [2025-03-16 19:42:21,587 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 248 transitions. Word has length 252 [2025-03-16 19:42:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:21,588 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 248 transitions. [2025-03-16 19:42:21,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 19:42:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 248 transitions. [2025-03-16 19:42:21,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-16 19:42:21,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:21,591 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:42:21,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:42:21,592 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:21,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:21,592 INFO L85 PathProgramCache]: Analyzing trace with hash -290067887, now seen corresponding path program 1 times [2025-03-16 19:42:21,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:21,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024905343] [2025-03-16 19:42:21,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:21,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:21,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-16 19:42:21,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-16 19:42:21,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:21,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-16 19:42:22,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:22,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024905343] [2025-03-16 19:42:22,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024905343] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:42:22,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593022732] [2025-03-16 19:42:22,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:22,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:22,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:22,058 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-16 19:42:22,060 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-16 19:42:22,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-16 19:42:22,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-16 19:42:22,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:22,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:22,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 1409 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:42:22,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:42:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-16 19:42:22,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:42:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-03-16 19:42:22,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593022732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:42:22,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:42:22,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 19:42:22,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801827835] [2025-03-16 19:42:22,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:42:22,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:42:22,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:22,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:42:22,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:42:22,977 INFO L87 Difference]: Start difference. First operand 164 states and 248 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-16 19:42:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:23,036 INFO L93 Difference]: Finished difference Result 328 states and 498 transitions. [2025-03-16 19:42:23,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:42:23,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 253 [2025-03-16 19:42:23,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:23,039 INFO L225 Difference]: With dead ends: 328 [2025-03-16 19:42:23,042 INFO L226 Difference]: Without dead ends: 166 [2025-03-16 19:42:23,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 503 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:42:23,044 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:23,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 729 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:23,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-16 19:42:23,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-03-16 19:42:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 102 states have internal predecessors, (132), 59 states have call successors, (59), 4 states have call predecessors, (59), 4 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-16 19:42:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 250 transitions. [2025-03-16 19:42:23,061 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 250 transitions. Word has length 253 [2025-03-16 19:42:23,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:23,062 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 250 transitions. [2025-03-16 19:42:23,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-16 19:42:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 250 transitions. [2025-03-16 19:42:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-16 19:42:23,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:23,064 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:42:23,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:42:23,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:23,269 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:23,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:23,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1245638223, now seen corresponding path program 2 times [2025-03-16 19:42:23,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:23,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268331464] [2025-03-16 19:42:23,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:42:23,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:23,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 255 statements into 2 equivalence classes. [2025-03-16 19:42:23,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 255 statements. [2025-03-16 19:42:23,486 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:42:23,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3127 trivial. 0 not checked. [2025-03-16 19:42:23,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:23,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268331464] [2025-03-16 19:42:23,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268331464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:23,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:23,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:42:23,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723103293] [2025-03-16 19:42:23,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:23,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:42:23,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:23,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:42:23,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:42:23,754 INFO L87 Difference]: Start difference. First operand 166 states and 250 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 19:42:23,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:23,805 INFO L93 Difference]: Finished difference Result 323 states and 490 transitions. [2025-03-16 19:42:23,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:42:23,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 255 [2025-03-16 19:42:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:23,811 INFO L225 Difference]: With dead ends: 323 [2025-03-16 19:42:23,811 INFO L226 Difference]: Without dead ends: 237 [2025-03-16 19:42:23,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:42:23,812 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 153 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:23,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 725 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:23,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-16 19:42:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 236. [2025-03-16 19:42:23,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 150 states have (on average 1.3666666666666667) internal successors, (205), 150 states have internal predecessors, (205), 77 states have call successors, (77), 8 states have call predecessors, (77), 8 states have return successors, (79), 77 states have call predecessors, (79), 77 states have call successors, (79) [2025-03-16 19:42:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 361 transitions. [2025-03-16 19:42:23,841 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 361 transitions. Word has length 255 [2025-03-16 19:42:23,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:23,841 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 361 transitions. [2025-03-16 19:42:23,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-03-16 19:42:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 361 transitions. [2025-03-16 19:42:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-16 19:42:23,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:23,845 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:42:23,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:42:23,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:23,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:23,846 INFO L85 PathProgramCache]: Analyzing trace with hash 988447496, now seen corresponding path program 1 times [2025-03-16 19:42:23,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:23,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880011045] [2025-03-16 19:42:23,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:23,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:24,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-16 19:42:24,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-16 19:42:24,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:24,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3824 trivial. 0 not checked. [2025-03-16 19:42:24,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:24,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880011045] [2025-03-16 19:42:24,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880011045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:42:24,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410635046] [2025-03-16 19:42:24,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:24,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:24,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:24,383 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-16 19:42:24,385 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-16 19:42:24,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-16 19:42:25,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-16 19:42:25,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:25,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:25,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 1916 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:42:25,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:42:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3824 trivial. 0 not checked. [2025-03-16 19:42:25,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:42:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3824 trivial. 0 not checked. [2025-03-16 19:42:25,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410635046] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:42:25,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:42:25,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-16 19:42:25,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797922840] [2025-03-16 19:42:25,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:42:25,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:42:25,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:25,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:42:25,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:42:25,414 INFO L87 Difference]: Start difference. First operand 236 states and 361 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-03-16 19:42:29,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:42:33,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:42:37,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:42:41,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:42:45,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:42:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:45,590 INFO L93 Difference]: Finished difference Result 480 states and 734 transitions. [2025-03-16 19:42:45,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:42:45,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) Word has length 323 [2025-03-16 19:42:45,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:45,593 INFO L225 Difference]: With dead ends: 480 [2025-03-16 19:42:45,593 INFO L226 Difference]: Without dead ends: 251 [2025-03-16 19:42:45,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:42:45,594 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 4 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:45,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 966 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2025-03-16 19:42:45,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-16 19:42:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-03-16 19:42:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 165 states have (on average 1.3515151515151516) internal successors, (223), 165 states have internal predecessors, (223), 77 states have call successors, (77), 8 states have call predecessors, (77), 8 states have return successors, (79), 77 states have call predecessors, (79), 77 states have call successors, (79) [2025-03-16 19:42:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 379 transitions. [2025-03-16 19:42:45,620 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 379 transitions. Word has length 323 [2025-03-16 19:42:45,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:45,621 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 379 transitions. [2025-03-16 19:42:45,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-03-16 19:42:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 379 transitions. [2025-03-16 19:42:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-16 19:42:45,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:45,626 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 12, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:42:45,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:42:45,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:45,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:45,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:45,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1886505471, now seen corresponding path program 2 times [2025-03-16 19:42:45,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:45,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324634550] [2025-03-16 19:42:45,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:42:45,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:46,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 338 statements into 2 equivalence classes. [2025-03-16 19:42:46,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 338 statements. [2025-03-16 19:42:46,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:42:46,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3948 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3948 trivial. 0 not checked. [2025-03-16 19:42:46,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:46,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324634550] [2025-03-16 19:42:46,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324634550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:46,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:46,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:42:46,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747950629] [2025-03-16 19:42:46,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:46,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:42:46,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:46,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:42:46,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:42:46,268 INFO L87 Difference]: Start difference. First operand 251 states and 379 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-16 19:42:50,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:42:54,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:42:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:54,442 INFO L93 Difference]: Finished difference Result 683 states and 1047 transitions. [2025-03-16 19:42:54,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:42:54,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 338 [2025-03-16 19:42:54,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:54,447 INFO L225 Difference]: With dead ends: 683 [2025-03-16 19:42:54,448 INFO L226 Difference]: Without dead ends: 470 [2025-03-16 19:42:54,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:42:54,450 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 231 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:54,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1006 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-03-16 19:42:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-16 19:42:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2025-03-16 19:42:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 298 states have (on average 1.3557046979865772) internal successors, (404), 298 states have internal predecessors, (404), 151 states have call successors, (151), 16 states have call predecessors, (151), 16 states have return successors, (162), 151 states have call predecessors, (162), 151 states have call successors, (162) [2025-03-16 19:42:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 717 transitions. [2025-03-16 19:42:54,505 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 717 transitions. Word has length 338 [2025-03-16 19:42:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:54,505 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 717 transitions. [2025-03-16 19:42:54,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-16 19:42:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 717 transitions. [2025-03-16 19:42:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-16 19:42:54,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:54,512 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 12, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:42:54,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:42:54,512 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:54,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:54,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1679821058, now seen corresponding path program 1 times [2025-03-16 19:42:54,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:54,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803419829] [2025-03-16 19:42:54,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:54,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:54,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-16 19:42:54,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-16 19:42:54,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:54,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:55,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3948 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3948 trivial. 0 not checked. [2025-03-16 19:42:55,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:55,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803419829] [2025-03-16 19:42:55,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803419829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:55,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:55,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:42:55,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28741599] [2025-03-16 19:42:55,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:55,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:42:55,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:55,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:42:55,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:42:55,489 INFO L87 Difference]: Start difference. First operand 466 states and 717 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (48), 1 states have call predecessors, (48), 2 states have return successors, (48), 3 states have call predecessors, (48), 4 states have call successors, (48) [2025-03-16 19:42:59,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:03,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:07,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:07,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:07,963 INFO L93 Difference]: Finished difference Result 787 states and 1191 transitions. [2025-03-16 19:43:07,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:07,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (48), 1 states have call predecessors, (48), 2 states have return successors, (48), 3 states have call predecessors, (48), 4 states have call successors, (48) Word has length 338 [2025-03-16 19:43:07,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:07,968 INFO L225 Difference]: With dead ends: 787 [2025-03-16 19:43:07,968 INFO L226 Difference]: Without dead ends: 423 [2025-03-16 19:43:07,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:07,969 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 235 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:07,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1344 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2025-03-16 19:43:07,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-16 19:43:08,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 419. [2025-03-16 19:43:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 267 states have (on average 1.2808988764044944) internal successors, (342), 269 states have internal predecessors, (342), 134 states have call successors, (134), 15 states have call predecessors, (134), 17 states have return successors, (142), 134 states have call predecessors, (142), 134 states have call successors, (142) [2025-03-16 19:43:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 618 transitions. [2025-03-16 19:43:08,005 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 618 transitions. Word has length 338 [2025-03-16 19:43:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:08,005 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 618 transitions. [2025-03-16 19:43:08,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (48), 1 states have call predecessors, (48), 2 states have return successors, (48), 3 states have call predecessors, (48), 4 states have call successors, (48) [2025-03-16 19:43:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 618 transitions. [2025-03-16 19:43:08,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-16 19:43:08,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:08,009 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 12, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:43:08,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:43:08,010 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:08,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:08,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1698066846, now seen corresponding path program 1 times [2025-03-16 19:43:08,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:08,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482897803] [2025-03-16 19:43:08,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:08,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:08,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-16 19:43:08,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-16 19:43:08,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:08,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3948 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 3842 trivial. 0 not checked. [2025-03-16 19:43:08,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:08,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482897803] [2025-03-16 19:43:08,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482897803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:08,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064909110] [2025-03-16 19:43:08,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:08,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:08,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:08,719 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-16 19:43:08,720 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-16 19:43:09,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-16 19:43:09,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-16 19:43:09,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:09,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:09,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 2272 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:43:09,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3948 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 3842 trivial. 0 not checked. [2025-03-16 19:43:09,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:43:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3948 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 3842 trivial. 0 not checked. [2025-03-16 19:43:10,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064909110] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:43:10,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:43:10,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 9 [2025-03-16 19:43:10,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615144759] [2025-03-16 19:43:10,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:43:10,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:43:10,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:10,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:43:10,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:43:10,175 INFO L87 Difference]: Start difference. First operand 419 states and 618 transitions. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 2 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-03-16 19:43:14,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:18,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:22,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:26,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:30,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:34,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:38,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:38,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:38,480 INFO L93 Difference]: Finished difference Result 826 states and 1223 transitions. [2025-03-16 19:43:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:43:38,481 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 2 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) Word has length 338 [2025-03-16 19:43:38,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:38,484 INFO L225 Difference]: With dead ends: 826 [2025-03-16 19:43:38,484 INFO L226 Difference]: Without dead ends: 429 [2025-03-16 19:43:38,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 670 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:43:38,486 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 2 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:38,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 962 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 7 Unknown, 0 Unchecked, 28.3s Time] [2025-03-16 19:43:38,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-16 19:43:38,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2025-03-16 19:43:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 277 states have (on average 1.2779783393501805) internal successors, (354), 279 states have internal predecessors, (354), 134 states have call successors, (134), 15 states have call predecessors, (134), 17 states have return successors, (142), 134 states have call predecessors, (142), 134 states have call successors, (142) [2025-03-16 19:43:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 630 transitions. [2025-03-16 19:43:38,542 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 630 transitions. Word has length 338 [2025-03-16 19:43:38,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:38,543 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 630 transitions. [2025-03-16 19:43:38,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 2 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-03-16 19:43:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 630 transitions. [2025-03-16 19:43:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-16 19:43:38,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:38,550 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 18, 6, 6, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:43:38,562 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-16 19:43:38,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:38,752 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:38,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:38,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1080173250, now seen corresponding path program 2 times [2025-03-16 19:43:38,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:38,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993371296] [2025-03-16 19:43:38,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:43:38,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:38,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 348 statements into 2 equivalence classes. [2025-03-16 19:43:39,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 348 of 348 statements. [2025-03-16 19:43:39,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 19:43:39,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4115 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4111 trivial. 0 not checked. [2025-03-16 19:43:39,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:39,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993371296] [2025-03-16 19:43:39,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993371296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:39,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798398955] [2025-03-16 19:43:39,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:43:39,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:39,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:39,634 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:43:39,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 19:43:40,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 348 statements into 2 equivalence classes.