./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_szymanski.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_szymanski.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 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:24:48,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:24:48,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:24:48,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:24:48,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:24:48,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:24:48,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:24:48,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:24:48,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:24:48,400 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:24:48,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:24:48,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:24:48,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:24:48,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:24:48,401 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:24:48,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:24:48,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:24:48,401 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:24:48,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:24:48,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:24:48,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:24:48,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:24:48,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:24:48,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:24:48,402 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:24:48,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:24:48,402 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:24:48,402 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:24:48,402 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:24:48,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:24:48,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:24:48,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:24:48,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:24:48,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:24:48,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:24:48,403 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:24:48,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:24:48,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:24:48,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:24:48,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:24:48,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:24:48,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:24:48,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:24:48,404 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 -> 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 [2025-03-03 15:24:48,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:24:48,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:24:48,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:24:48,643 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:24:48,643 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:24:48,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_szymanski.i [2025-03-03 15:24:49,786 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf819042/136a253bd3614824a71da913e944a358/FLAG171e720c7 [2025-03-03 15:24:50,046 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:24:50,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i [2025-03-03 15:24:50,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf819042/136a253bd3614824a71da913e944a358/FLAG171e720c7 [2025-03-03 15:24:50,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf819042/136a253bd3614824a71da913e944a358 [2025-03-03 15:24:50,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:24:50,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:24:50,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:24:50,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:24:50,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:24:50,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e614eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50, skipping insertion in model container [2025-03-03 15:24:50,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:24:50,540 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_szymanski.i[23606,23619] [2025-03-03 15:24:50,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:24:50,615 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:24:50,644 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_szymanski.i[23606,23619] [2025-03-03 15:24:50,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:24:50,708 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:24:50,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50 WrapperNode [2025-03-03 15:24:50,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:24:50,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:24:50,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:24:50,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:24:50,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,745 INFO L138 Inliner]: procedures = 145, calls = 298, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 403 [2025-03-03 15:24:50,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:24:50,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:24:50,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:24:50,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:24:50,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,789 INFO L175 MemorySlicer]: Split 144 memory accesses to 16 slices as follows [2, 8, 8, 13, 13, 8, 29, 21, 0, 6, 7, 7, 7, 5, 5, 5]. 20 percent of accesses are in the largest equivalence class. The 40 initializations are split as follows [2, 3, 3, 0, 0, 3, 9, 9, 0, 2, 3, 3, 3, 0, 0, 0]. The 36 writes are split as follows [0, 2, 2, 1, 1, 2, 11, 6, 0, 2, 2, 2, 2, 1, 1, 1]. [2025-03-03 15:24:50,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,807 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:24:50,827 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:24:50,828 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:24:50,828 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:24:50,829 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (1/1) ... [2025-03-03 15:24:50,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:24:50,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:50,854 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-03 15:24:50,860 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-03 15:24:50,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-03 15:24:50,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 15:24:50,880 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-03 15:24:50,880 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 15:24:50,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-03 15:24:50,881 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:24:50,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-03 15:24:50,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-03 15:24:50,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-03 15:24:50,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-03 15:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-03 15:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-03 15:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-03 15:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-03 15:24:50,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-03 15:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 15:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 15:24:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 15:24:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 15:24:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 15:24:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 15:24:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 15:24:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 15:24:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 15:24:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 15:24:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 15:24:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 15:24:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 15:24:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 15:24:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 15:24:50,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:24:50,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:24:51,086 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:24:51,087 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:24:55,499 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-03-03 15:24:55,499 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:24:55,506 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:24:55,508 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:24:55,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:24:55 BoogieIcfgContainer [2025-03-03 15:24:55,508 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:24:55,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:24:55,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:24:55,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:24:55,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:24:50" (1/3) ... [2025-03-03 15:24:55,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a1ee6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:24:55, skipping insertion in model container [2025-03-03 15:24:55,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:50" (2/3) ... [2025-03-03 15:24:55,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a1ee6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:24:55, skipping insertion in model container [2025-03-03 15:24:55,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:24:55" (3/3) ... [2025-03-03 15:24:55,518 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_szymanski.i [2025-03-03 15:24:55,527 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:24:55,528 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_szymanski.i that has 6 procedures, 106 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 15:24:55,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:24:55,573 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;@7adc12cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:24:55,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:24:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 68 states have internal predecessors, (88), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 15:24:55,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 15:24:55,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:55,587 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:55,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:55,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:55,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1502909704, now seen corresponding path program 1 times [2025-03-03 15:24:55,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:55,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720010363] [2025-03-03 15:24:55,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:55,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:55,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 15:24:55,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 15:24:55,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:55,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:56,106 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 15:24:56,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:56,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720010363] [2025-03-03 15:24:56,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720010363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:56,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:56,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:24:56,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193934401] [2025-03-03 15:24:56,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:56,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:24:56,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:56,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:24:56,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:24:56,125 INFO L87 Difference]: Start difference. First operand has 106 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 68 states have internal predecessors, (88), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 15:25:00,152 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-03 15:25:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:00,196 INFO L93 Difference]: Finished difference Result 210 states and 332 transitions. [2025-03-03 15:25:00,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:25:00,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-03-03 15:25:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:00,211 INFO L225 Difference]: With dead ends: 210 [2025-03-03 15:25:00,212 INFO L226 Difference]: Without dead ends: 104 [2025-03-03 15:25:00,215 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-03 15:25:00,217 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 291 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.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:00,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 291 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-03 15:25:00,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-03 15:25:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-03 15:25:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 65 states have internal predecessors, (83), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 15:25:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 147 transitions. [2025-03-03 15:25:00,253 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 147 transitions. Word has length 119 [2025-03-03 15:25:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:00,254 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 147 transitions. [2025-03-03 15:25:00,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 15:25:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 147 transitions. [2025-03-03 15:25:00,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 15:25:00,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:00,261 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:25:00,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:25:00,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:00,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:00,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2026489512, now seen corresponding path program 1 times [2025-03-03 15:25:00,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:00,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787536224] [2025-03-03 15:25:00,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:00,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:00,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 15:25:00,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 15:25:00,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:00,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 15:25:00,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:00,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787536224] [2025-03-03 15:25:00,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787536224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:25:00,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:25:00,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:25:00,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403092422] [2025-03-03 15:25:00,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:25:00,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:25:00,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:00,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:25:00,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:25:00,517 INFO L87 Difference]: Start difference. First operand 103 states and 147 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 15:25:00,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:00,543 INFO L93 Difference]: Finished difference Result 204 states and 293 transitions. [2025-03-03 15:25:00,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:25:00,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2025-03-03 15:25:00,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:00,548 INFO L225 Difference]: With dead ends: 204 [2025-03-03 15:25:00,548 INFO L226 Difference]: Without dead ends: 104 [2025-03-03 15:25:00,549 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-03 15:25:00,549 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 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-03 15:25:00,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:25:00,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-03 15:25:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-03 15:25:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 66 states have internal predecessors, (84), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 15:25:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 148 transitions. [2025-03-03 15:25:00,560 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 148 transitions. Word has length 121 [2025-03-03 15:25:00,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:00,560 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 148 transitions. [2025-03-03 15:25:00,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 15:25:00,560 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 148 transitions. [2025-03-03 15:25:00,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 15:25:00,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:00,562 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:25:00,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:25:00,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:00,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:00,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1760753185, now seen corresponding path program 1 times [2025-03-03 15:25:00,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:00,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745472062] [2025-03-03 15:25:00,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:00,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:00,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 15:25:00,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 15:25:00,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:00,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:00,799 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 15:25:00,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:00,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745472062] [2025-03-03 15:25:00,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745472062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:25:00,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169421074] [2025-03-03 15:25:00,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:00,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:00,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:25:00,803 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-03 15:25:00,805 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-03 15:25:01,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 15:25:01,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 15:25:01,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:01,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:01,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:25:01,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:25:01,133 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 15:25:01,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:25:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 15:25:01,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169421074] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:25:01,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:25:01,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 15:25:01,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002680045] [2025-03-03 15:25:01,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:25:01,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:25:01,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:01,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:25:01,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:25:01,270 INFO L87 Difference]: Start difference. First operand 104 states and 148 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 15:25:01,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:01,302 INFO L93 Difference]: Finished difference Result 207 states and 297 transitions. [2025-03-03 15:25:01,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:25:01,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 122 [2025-03-03 15:25:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:01,305 INFO L225 Difference]: With dead ends: 207 [2025-03-03 15:25:01,306 INFO L226 Difference]: Without dead ends: 106 [2025-03-03 15:25:01,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 241 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-03 15:25:01,307 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 429 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-03 15:25:01,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 429 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:25:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-03 15:25:01,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-03 15:25:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 15:25:01,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 150 transitions. [2025-03-03 15:25:01,322 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 150 transitions. Word has length 122 [2025-03-03 15:25:01,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:01,323 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 150 transitions. [2025-03-03 15:25:01,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 15:25:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 150 transitions. [2025-03-03 15:25:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 15:25:01,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:01,325 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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] [2025-03-03 15:25:01,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:25:01,526 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-03 15:25:01,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:01,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:01,527 INFO L85 PathProgramCache]: Analyzing trace with hash -609124609, now seen corresponding path program 2 times [2025-03-03 15:25:01,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:01,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660711123] [2025-03-03 15:25:01,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:25:01,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:01,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 124 statements into 2 equivalence classes. [2025-03-03 15:25:01,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 124 statements. [2025-03-03 15:25:01,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:25:01,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2025-03-03 15:25:01,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:01,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660711123] [2025-03-03 15:25:01,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660711123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:25:01,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:25:01,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:25:01,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921447798] [2025-03-03 15:25:01,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:25:01,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:25:01,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:01,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:25:01,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:25:01,792 INFO L87 Difference]: Start difference. First operand 106 states and 150 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 15:25:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:01,827 INFO L93 Difference]: Finished difference Result 202 states and 291 transitions. [2025-03-03 15:25:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:25:01,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2025-03-03 15:25:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:01,831 INFO L225 Difference]: With dead ends: 202 [2025-03-03 15:25:01,833 INFO L226 Difference]: Without dead ends: 160 [2025-03-03 15:25:01,834 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-03 15:25:01,835 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 95 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:01,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 454 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:25:01,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-03 15:25:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-03-03 15:25:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2025-03-03 15:25:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 229 transitions. [2025-03-03 15:25:01,855 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 229 transitions. Word has length 124 [2025-03-03 15:25:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:01,855 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 229 transitions. [2025-03-03 15:25:01,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 15:25:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 229 transitions. [2025-03-03 15:25:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 15:25:01,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:01,857 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 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] [2025-03-03 15:25:01,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:25:01,857 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:01,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:01,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1649874640, now seen corresponding path program 1 times [2025-03-03 15:25:01,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:01,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390116419] [2025-03-03 15:25:01,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:01,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:01,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 15:25:01,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 15:25:01,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:01,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2025-03-03 15:25:02,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:02,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390116419] [2025-03-03 15:25:02,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390116419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:25:02,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087388456] [2025-03-03 15:25:02,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:02,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:02,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:25:02,143 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-03 15:25:02,144 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-03 15:25:02,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 15:25:02,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 15:25:02,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:02,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:02,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 1360 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:25:02,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:25:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2025-03-03 15:25:02,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:25:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2025-03-03 15:25:02,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087388456] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:25:02,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:25:02,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 15:25:02,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133358398] [2025-03-03 15:25:02,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:25:02,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:25:02,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:02,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:25:02,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:25:02,748 INFO L87 Difference]: Start difference. First operand 160 states and 229 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-03 15:25:06,792 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-03 15:25:08,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:12,831 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-03 15:25:12,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:12,855 INFO L93 Difference]: Finished difference Result 322 states and 462 transitions. [2025-03-03 15:25:12,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:25:12,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 193 [2025-03-03 15:25:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:12,860 INFO L225 Difference]: With dead ends: 322 [2025-03-03 15:25:12,860 INFO L226 Difference]: Without dead ends: 170 [2025-03-03 15:25:12,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 383 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-03 15:25:12,861 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 2 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:12,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 284 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time] [2025-03-03 15:25:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-03 15:25:12,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-03-03 15:25:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2025-03-03 15:25:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 241 transitions. [2025-03-03 15:25:12,885 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 241 transitions. Word has length 193 [2025-03-03 15:25:12,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:12,885 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 241 transitions. [2025-03-03 15:25:12,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-03 15:25:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 241 transitions. [2025-03-03 15:25:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 15:25:12,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:12,889 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 4, 3, 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] [2025-03-03 15:25:12,898 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-03 15:25:13,090 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-03 15:25:13,090 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:13,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:13,090 INFO L85 PathProgramCache]: Analyzing trace with hash 20728016, now seen corresponding path program 2 times [2025-03-03 15:25:13,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:13,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290113235] [2025-03-03 15:25:13,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:25:13,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:13,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 203 statements into 2 equivalence classes. [2025-03-03 15:25:13,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 203 statements. [2025-03-03 15:25:13,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:25:13,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:13,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-03-03 15:25:13,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:13,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290113235] [2025-03-03 15:25:13,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290113235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:25:13,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:25:13,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:25:13,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521672186] [2025-03-03 15:25:13,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:25:13,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:25:13,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:13,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:25:13,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:25:13,397 INFO L87 Difference]: Start difference. First operand 170 states and 241 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 15:25:17,409 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-03 15:25:18,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:18,164 INFO L93 Difference]: Finished difference Result 448 states and 643 transitions. [2025-03-03 15:25:18,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:25:18,165 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), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 203 [2025-03-03 15:25:18,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:18,167 INFO L225 Difference]: With dead ends: 448 [2025-03-03 15:25:18,167 INFO L226 Difference]: Without dead ends: 312 [2025-03-03 15:25:18,168 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-03 15:25:18,168 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 130 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:18,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 601 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-03-03 15:25:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-03 15:25:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2025-03-03 15:25:18,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 200 states have (on average 1.285) internal successors, (257), 200 states have internal predecessors, (257), 87 states have call successors, (87), 20 states have call predecessors, (87), 20 states have return successors, (102), 87 states have call predecessors, (102), 87 states have call successors, (102) [2025-03-03 15:25:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 446 transitions. [2025-03-03 15:25:18,205 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 446 transitions. Word has length 203 [2025-03-03 15:25:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:18,205 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 446 transitions. [2025-03-03 15:25:18,205 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), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 15:25:18,205 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 446 transitions. [2025-03-03 15:25:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 15:25:18,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:18,210 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 4, 3, 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] [2025-03-03 15:25:18,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:25:18,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:18,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:18,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1620946318, now seen corresponding path program 1 times [2025-03-03 15:25:18,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:18,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95230768] [2025-03-03 15:25:18,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:18,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:18,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 15:25:18,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 15:25:18,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:18,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:18,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-03-03 15:25:18,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:18,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95230768] [2025-03-03 15:25:18,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95230768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:25:18,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:25:18,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:25:18,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300592092] [2025-03-03 15:25:18,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:25:18,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:25:18,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:18,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:25:18,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:25:18,784 INFO L87 Difference]: Start difference. First operand 308 states and 446 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 15:25:19,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:20,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:20,762 INFO L93 Difference]: Finished difference Result 562 states and 801 transitions. [2025-03-03 15:25:20,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:25:20,763 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), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 203 [2025-03-03 15:25:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:20,766 INFO L225 Difference]: With dead ends: 562 [2025-03-03 15:25:20,766 INFO L226 Difference]: Without dead ends: 282 [2025-03-03 15:25:20,767 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-03 15:25:20,768 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 126 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:20,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 605 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 15:25:20,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-03 15:25:20,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 278. [2025-03-03 15:25:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 181 states have (on average 1.2430939226519337) internal successors, (225), 181 states have internal predecessors, (225), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (86), 78 states have call predecessors, (86), 78 states have call successors, (86) [2025-03-03 15:25:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 389 transitions. [2025-03-03 15:25:20,805 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 389 transitions. Word has length 203 [2025-03-03 15:25:20,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:20,806 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 389 transitions. [2025-03-03 15:25:20,807 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), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 15:25:20,807 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 389 transitions. [2025-03-03 15:25:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 15:25:20,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:20,810 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 4, 3, 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] [2025-03-03 15:25:20,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:25:20,811 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:20,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:20,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1484777579, now seen corresponding path program 1 times [2025-03-03 15:25:20,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:20,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224750939] [2025-03-03 15:25:20,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:20,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:20,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 15:25:20,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 15:25:20,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:20,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2025-03-03 15:25:21,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:21,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224750939] [2025-03-03 15:25:21,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224750939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:25:21,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893931724] [2025-03-03 15:25:21,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:21,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:21,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:25:21,263 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-03 15:25:21,265 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-03 15:25:21,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 15:25:21,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 15:25:21,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:21,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:21,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 15:25:21,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:25:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 288 proven. 4 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2025-03-03 15:25:21,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:25:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2025-03-03 15:25:22,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893931724] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:25:22,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:25:22,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-03 15:25:22,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173409513] [2025-03-03 15:25:22,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:25:22,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:25:22,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:22,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:25:22,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:25:22,152 INFO L87 Difference]: Start difference. First operand 278 states and 389 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (54), 5 states have call predecessors, (54), 6 states have return successors, (55), 7 states have call predecessors, (55), 9 states have call successors, (55) [2025-03-03 15:25:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:23,247 INFO L93 Difference]: Finished difference Result 562 states and 800 transitions. [2025-03-03 15:25:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:25:23,248 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (54), 5 states have call predecessors, (54), 6 states have return successors, (55), 7 states have call predecessors, (55), 9 states have call successors, (55) Word has length 203 [2025-03-03 15:25:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:23,251 INFO L225 Difference]: With dead ends: 562 [2025-03-03 15:25:23,252 INFO L226 Difference]: Without dead ends: 308 [2025-03-03 15:25:23,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:25:23,255 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 194 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:23,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 437 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:25:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-03 15:25:23,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2025-03-03 15:25:23,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 203 states have (on average 1.2610837438423645) internal successors, (256), 205 states have internal predecessors, (256), 73 states have call successors, (73), 26 states have call predecessors, (73), 28 states have return successors, (93), 73 states have call predecessors, (93), 73 states have call successors, (93) [2025-03-03 15:25:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 422 transitions. [2025-03-03 15:25:23,298 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 422 transitions. Word has length 203 [2025-03-03 15:25:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:23,299 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 422 transitions. [2025-03-03 15:25:23,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (54), 5 states have call predecessors, (54), 6 states have return successors, (55), 7 states have call predecessors, (55), 9 states have call successors, (55) [2025-03-03 15:25:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 422 transitions. [2025-03-03 15:25:23,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 15:25:23,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:23,301 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 4, 3, 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] [2025-03-03 15:25:23,311 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-03 15:25:23,501 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-03 15:25:23,502 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:23,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:23,502 INFO L85 PathProgramCache]: Analyzing trace with hash -825795541, now seen corresponding path program 1 times [2025-03-03 15:25:23,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:23,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046258398] [2025-03-03 15:25:23,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:23,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:23,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 15:25:23,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 15:25:23,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:23,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2025-03-03 15:25:26,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:26,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046258398] [2025-03-03 15:25:26,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046258398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:25:26,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465758740] [2025-03-03 15:25:26,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:26,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:26,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:25:26,209 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-03 15:25:26,223 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-03 15:25:26,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 15:25:26,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 15:25:26,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:26,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:26,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 1705 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 15:25:26,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:25:26,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-03 15:25:27,105 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-03 15:25:27,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 15 [2025-03-03 15:25:27,181 INFO L349 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2025-03-03 15:25:27,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2025-03-03 15:25:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 333 proven. 4 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2025-03-03 15:25:28,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:25:29,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2025-03-03 15:25:29,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-03-03 15:25:41,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465758740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:25:41,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 15:25:41,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2025-03-03 15:25:41,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149458257] [2025-03-03 15:25:41,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 15:25:41,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 15:25:41,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:41,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 15:25:41,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1067, Unknown=1, NotChecked=0, Total=1190 [2025-03-03 15:25:41,896 INFO L87 Difference]: Start difference. First operand 305 states and 422 transitions. Second operand has 30 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 27 states have internal predecessors, (104), 14 states have call successors, (55), 9 states have call predecessors, (55), 11 states have return successors, (55), 12 states have call predecessors, (55), 14 states have call successors, (55) [2025-03-03 15:25:46,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:50,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:54,825 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-03 15:25:59,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:26:03,341 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-03 15:26:05,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:26:09,170 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 [0] [2025-03-03 15:26:13,180 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-03 15:26:17,190 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-03 15:26:21,216 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-03 15:26:25,232 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-03 15:26:29,258 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 []