./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_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-?-8fc3dc6-m [2025-03-16 19:43:48,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:43:48,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:43:48,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:43:48,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:43:48,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:43:48,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:43:48,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:43:48,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:43:48,673 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:43:48,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:43:48,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:43:48,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:43:48,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:43:48,673 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:43:48,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:43:48,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:43:48,674 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:43:48,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:43:48,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:43:48,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:43:48,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:43:48,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:43:48,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:43:48,674 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:43:48,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:43:48,674 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:43:48,674 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:43:48,674 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:43:48,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:43:48,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:43:48,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:43:48,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:43:48,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:43:48,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:43:48,675 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:43:48,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:43:48,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:43:48,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:43:48,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:43:48,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:43:48,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:43:48,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:43:48,675 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-16 19:43:48,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:43:48,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:43:48,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:43:48,915 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:43:48,915 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:43:48,916 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-16 19:43:50,016 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/076d4af42/116cb48a95534bffa8c07f3b76d8383e/FLAGd7cb621ab [2025-03-16 19:43:50,307 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:43:50,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i [2025-03-16 19:43:50,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/076d4af42/116cb48a95534bffa8c07f3b76d8383e/FLAGd7cb621ab [2025-03-16 19:43:50,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/076d4af42/116cb48a95534bffa8c07f3b76d8383e [2025-03-16 19:43:50,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:43:50,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:43:50,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:43:50,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:43:50,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:43:50,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:43:50" (1/1) ... [2025-03-16 19:43:50,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2646df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:50, skipping insertion in model container [2025-03-16 19:43:50,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:43:50" (1/1) ... [2025-03-16 19:43:50,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:43:50,863 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-16 19:43:50,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:43:50,976 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:43:50,998 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-16 19:43:51,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:43:51,061 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:43:51,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:51 WrapperNode [2025-03-16 19:43:51,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:43:51,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:43:51,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:43:51,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:43:51,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:51" (1/1) ... [2025-03-16 19:43:51,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:51" (1/1) ... [2025-03-16 19:43:51,111 INFO L138 Inliner]: procedures = 145, calls = 298, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 403 [2025-03-16 19:43:51,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:43:51,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:43:51,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:43:51,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:43:51,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:51" (1/1) ... [2025-03-16 19:43:51,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:51" (1/1) ... [2025-03-16 19:43:51,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:51" (1/1) ... [2025-03-16 19:43:51,157 INFO L175 MemorySlicer]: Split 144 memory accesses to 16 slices as follows [2, 8, 8, 13, 8, 29, 21, 0, 6, 7, 7, 7, 5, 5, 13, 5]. 20 percent of accesses are in the largest equivalence class. The 40 initializations are split as follows [2, 3, 3, 0, 3, 9, 9, 0, 2, 3, 3, 3, 0, 0, 0, 0]. The 36 writes are split as follows [0, 2, 2, 1, 2, 11, 6, 0, 2, 2, 2, 2, 1, 1, 1, 1]. [2025-03-16 19:43:51,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:51" (1/1) ... [2025-03-16 19:43:51,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:51" (1/1) ... [2025-03-16 19:43:51,178 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:51" (1/1) ... [2025-03-16 19:43:51,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:51" (1/1) ... [2025-03-16 19:43:51,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:51" (1/1) ... [2025-03-16 19:43:51,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:51" (1/1) ... [2025-03-16 19:43:51,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:43:51,200 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:43:51,201 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:43:51,201 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:43:51,202 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:51" (1/1) ... [2025-03-16 19:43:51,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:43:51,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:51,227 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:43:51,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:43:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 19:43:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 19:43:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 19:43:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 19:43:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-16 19:43:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-16 19:43:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-16 19:43:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-16 19:43:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-16 19:43:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-16 19:43:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-16 19:43:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-16 19:43:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-16 19:43:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-16 19:43:51,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-16 19:43:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-16 19:43:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 19:43:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 19:43:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 19:43:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 19:43:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-16 19:43:51,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-16 19:43:51,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-16 19:43:51,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-16 19:43:51,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-16 19:43:51,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-16 19:43:51,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-16 19:43:51,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-16 19:43:51,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-16 19:43:51,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-16 19:43:51,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-16 19:43:51,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-16 19:43:51,257 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 19:43:51,257 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 19:43:51,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:43:51,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 19:43:51,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 19:43:51,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 19:43:51,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 19:43:51,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-16 19:43:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-16 19:43:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-16 19:43:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-16 19:43:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-16 19:43:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-16 19:43:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-16 19:43:51,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-16 19:43:51,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-16 19:43:51,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-16 19:43:51,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-16 19:43:51,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-16 19:43:51,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-16 19:43:51,259 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-16 19:43:51,259 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-16 19:43:51,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 19:43:51,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 19:43:51,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 19:43:51,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-16 19:43:51,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-16 19:43:51,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-16 19:43:51,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-16 19:43:51,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-16 19:43:51,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-16 19:43:51,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-16 19:43:51,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-16 19:43:51,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-16 19:43:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-16 19:43:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-16 19:43:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-16 19:43:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-16 19:43:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-16 19:43:51,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-16 19:43:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:43:51,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:43:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 19:43:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 19:43:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 19:43:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 19:43:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-16 19:43:51,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-16 19:43:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-16 19:43:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-16 19:43:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-16 19:43:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-16 19:43:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-16 19:43:51,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-16 19:43:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-16 19:43:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-16 19:43:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-16 19:43:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-16 19:43:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-16 19:43:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-16 19:43:51,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-16 19:43:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:43:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 19:43:51,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 19:43:51,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 19:43:51,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 19:43:51,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 19:43:51,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 19:43:51,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 19:43:51,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 19:43:51,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 19:43:51,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 19:43:51,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 19:43:51,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 19:43:51,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 19:43:51,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 19:43:51,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-16 19:43:51,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:43:51,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:43:51,444 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:43:51,446 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:43:52,561 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-03-16 19:43:52,562 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:43:52,574 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:43:52,575 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:43:52,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:43:52 BoogieIcfgContainer [2025-03-16 19:43:52,575 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:43:52,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:43:52,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:43:52,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:43:52,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:43:50" (1/3) ... [2025-03-16 19:43:52,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b69ee2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:43:52, skipping insertion in model container [2025-03-16 19:43:52,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:51" (2/3) ... [2025-03-16 19:43:52,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b69ee2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:43:52, skipping insertion in model container [2025-03-16 19:43:52,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:43:52" (3/3) ... [2025-03-16 19:43:52,582 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_szymanski.i [2025-03-16 19:43:52,592 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:43:52,593 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_szymanski.i that has 6 procedures, 104 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 19:43:52,633 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:43:52,640 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;@59790616, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:43:52,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:43:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 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-16 19:43:52,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 19:43:52,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:52,651 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] [2025-03-16 19:43:52,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:52,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:52,655 INFO L85 PathProgramCache]: Analyzing trace with hash -450764328, now seen corresponding path program 1 times [2025-03-16 19:43:52,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:52,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253686316] [2025-03-16 19:43:52,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:52,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:52,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 19:43:52,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 19:43:52,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:52,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:53,208 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-16 19:43:53,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:53,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253686316] [2025-03-16 19:43:53,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253686316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:53,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:53,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:43:53,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321313458] [2025-03-16 19:43:53,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:53,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:43:53,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:53,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:43:53,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:43:53,235 INFO L87 Difference]: Start difference. First operand has 104 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 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) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-16 19:43:57,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:57,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:57,308 INFO L93 Difference]: Finished difference Result 207 states and 329 transitions. [2025-03-16 19:43:57,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:43:57,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 118 [2025-03-16 19:43:57,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:57,313 INFO L225 Difference]: With dead ends: 207 [2025-03-16 19:43:57,314 INFO L226 Difference]: Without dead ends: 103 [2025-03-16 19:43:57,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:43:57,318 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 287 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-16 19:43:57,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 287 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-16 19:43:57,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-16 19:43:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-03-16 19:43:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 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-16 19:43:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 146 transitions. [2025-03-16 19:43:57,367 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 146 transitions. Word has length 118 [2025-03-16 19:43:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:57,367 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 146 transitions. [2025-03-16 19:43:57,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-16 19:43:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 146 transitions. [2025-03-16 19:43:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 19:43:57,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:57,372 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] [2025-03-16 19:43:57,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:43:57,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:57,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:57,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1511065784, now seen corresponding path program 1 times [2025-03-16 19:43:57,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:57,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030236246] [2025-03-16 19:43:57,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:57,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:57,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 19:43:57,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 19:43:57,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:57,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:57,607 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-16 19:43:57,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:57,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030236246] [2025-03-16 19:43:57,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030236246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:57,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:57,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:43:57,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418229440] [2025-03-16 19:43:57,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:57,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:43:57,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:57,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:43:57,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:43:57,610 INFO L87 Difference]: Start difference. First operand 102 states and 146 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-16 19:43:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:57,639 INFO L93 Difference]: Finished difference Result 203 states and 292 transitions. [2025-03-16 19:43:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:43:57,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 120 [2025-03-16 19:43:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:57,641 INFO L225 Difference]: With dead ends: 203 [2025-03-16 19:43:57,641 INFO L226 Difference]: Without dead ends: 103 [2025-03-16 19:43:57,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:43:57,642 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:57,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:43:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-16 19:43:57,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-16 19:43:57,651 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-16 19:43:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 147 transitions. [2025-03-16 19:43:57,653 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 147 transitions. Word has length 120 [2025-03-16 19:43:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:57,653 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 147 transitions. [2025-03-16 19:43:57,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-16 19:43:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 147 transitions. [2025-03-16 19:43:57,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:43:57,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:57,656 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-16 19:43:57,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:43:57,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:57,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:57,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1285518541, now seen corresponding path program 1 times [2025-03-16 19:43:57,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:57,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256629647] [2025-03-16 19:43:57,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:57,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:57,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:43:57,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:43:57,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:57,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:57,876 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-16 19:43:57,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256629647] [2025-03-16 19:43:57,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256629647] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567756768] [2025-03-16 19:43:57,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:57,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:57,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:57,880 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:43:57,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:43:58,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:43:58,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:43:58,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:58,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:58,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:43:58,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:58,256 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-16 19:43:58,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:43:58,373 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-16 19:43:58,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567756768] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:43:58,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:43:58,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 19:43:58,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713029367] [2025-03-16 19:43:58,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:43:58,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:43:58,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:58,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:43:58,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:43:58,376 INFO L87 Difference]: Start difference. First operand 103 states and 147 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-16 19:43:58,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:58,418 INFO L93 Difference]: Finished difference Result 206 states and 296 transitions. [2025-03-16 19:43:58,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:43:58,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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 121 [2025-03-16 19:43:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:58,424 INFO L225 Difference]: With dead ends: 206 [2025-03-16 19:43:58,424 INFO L226 Difference]: Without dead ends: 105 [2025-03-16 19:43:58,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:43:58,425 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:58,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 567 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:43:58,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-16 19:43:58,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-16 19:43:58,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 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-16 19:43:58,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 149 transitions. [2025-03-16 19:43:58,434 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 149 transitions. Word has length 121 [2025-03-16 19:43:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:58,434 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 149 transitions. [2025-03-16 19:43:58,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-16 19:43:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 149 transitions. [2025-03-16 19:43:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 19:43:58,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:58,436 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] [2025-03-16 19:43:58,444 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-16 19:43:58,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:58,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:58,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:58,637 INFO L85 PathProgramCache]: Analyzing trace with hash 948295725, now seen corresponding path program 2 times [2025-03-16 19:43:58,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:58,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699079160] [2025-03-16 19:43:58,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:43:58,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:58,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-03-16 19:43:58,725 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 123 statements. [2025-03-16 19:43:58,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:43:58,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:58,856 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-16 19:43:58,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:58,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699079160] [2025-03-16 19:43:58,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699079160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:58,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:58,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:43:58,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954574072] [2025-03-16 19:43:58,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:58,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:43:58,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:58,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:43:58,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:43:58,858 INFO L87 Difference]: Start difference. First operand 105 states and 149 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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-16 19:43:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:58,893 INFO L93 Difference]: Finished difference Result 201 states and 290 transitions. [2025-03-16 19:43:58,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:43:58,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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 123 [2025-03-16 19:43:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:58,897 INFO L225 Difference]: With dead ends: 201 [2025-03-16 19:43:58,897 INFO L226 Difference]: Without dead ends: 159 [2025-03-16 19:43:58,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:58,899 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 95 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 452 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-16 19:43:58,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 452 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:43:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-16 19:43:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-16 19:43:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 103 states have internal predecessors, (134), 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-16 19:43:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 228 transitions. [2025-03-16 19:43:58,916 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 228 transitions. Word has length 123 [2025-03-16 19:43:58,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:58,916 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 228 transitions. [2025-03-16 19:43:58,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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-16 19:43:58,917 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 228 transitions. [2025-03-16 19:43:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-16 19:43:58,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:58,919 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] [2025-03-16 19:43:58,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:43:58,919 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:58,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash -724485523, now seen corresponding path program 1 times [2025-03-16 19:43:58,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:58,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504911041] [2025-03-16 19:43:58,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:58,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:58,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-16 19:43:59,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-16 19:43:59,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:59,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:59,164 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-16 19:43:59,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:59,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504911041] [2025-03-16 19:43:59,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504911041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:59,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418294491] [2025-03-16 19:43:59,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:59,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:59,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:59,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:43:59,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:43:59,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-16 19:43:59,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-16 19:43:59,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:59,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:59,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:43:59,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:59,602 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-16 19:43:59,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:43:59,768 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-16 19:43:59,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418294491] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:43:59,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:43:59,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2025-03-16 19:43:59,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903464789] [2025-03-16 19:43:59,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:43:59,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:43:59,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:59,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:43:59,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:43:59,773 INFO L87 Difference]: Start difference. First operand 159 states and 228 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-16 19:44:04,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:44:05,013 INFO L93 Difference]: Finished difference Result 321 states and 461 transitions. [2025-03-16 19:44:05,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:44:05,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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 192 [2025-03-16 19:44:05,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:44:05,015 INFO L225 Difference]: With dead ends: 321 [2025-03-16 19:44:05,015 INFO L226 Difference]: Without dead ends: 169 [2025-03-16 19:44:05,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:44:05,016 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 2 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:44:05,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 562 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-03-16 19:44:05,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-16 19:44:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-16 19:44:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 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-16 19:44:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 240 transitions. [2025-03-16 19:44:05,035 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 240 transitions. Word has length 192 [2025-03-16 19:44:05,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:44:05,036 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 240 transitions. [2025-03-16 19:44:05,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-16 19:44:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 240 transitions. [2025-03-16 19:44:05,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-16 19:44:05,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:44:05,044 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] [2025-03-16 19:44:05,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:44:05,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:44:05,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:44:05,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:44:05,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1533799117, now seen corresponding path program 2 times [2025-03-16 19:44:05,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:44:05,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460156883] [2025-03-16 19:44:05,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:44:05,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:44:05,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-03-16 19:44:05,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 202 statements. [2025-03-16 19:44:05,338 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:44:05,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:44:05,464 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-16 19:44:05,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:44:05,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460156883] [2025-03-16 19:44:05,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460156883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:44:05,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:44:05,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:44:05,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317174056] [2025-03-16 19:44:05,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:44:05,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:44:05,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:44:05,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:44:05,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:44:05,467 INFO L87 Difference]: Start difference. First operand 169 states and 240 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-16 19:44:09,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:10,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:44:10,603 INFO L93 Difference]: Finished difference Result 447 states and 642 transitions. [2025-03-16 19:44:10,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:44:10,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 202 [2025-03-16 19:44:10,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:44:10,609 INFO L225 Difference]: With dead ends: 447 [2025-03-16 19:44:10,609 INFO L226 Difference]: Without dead ends: 311 [2025-03-16 19:44:10,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:44:10,610 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 130 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:44:10,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 599 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2025-03-16 19:44:10,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-16 19:44:10,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 307. [2025-03-16 19:44:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 199 states have (on average 1.2864321608040201) internal successors, (256), 199 states have internal predecessors, (256), 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-16 19:44:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 445 transitions. [2025-03-16 19:44:10,637 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 445 transitions. Word has length 202 [2025-03-16 19:44:10,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:44:10,637 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 445 transitions. [2025-03-16 19:44:10,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-16 19:44:10,637 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 445 transitions. [2025-03-16 19:44:10,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-16 19:44:10,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:44:10,639 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] [2025-03-16 19:44:10,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:44:10,640 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:44:10,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:44:10,640 INFO L85 PathProgramCache]: Analyzing trace with hash 739388972, now seen corresponding path program 1 times [2025-03-16 19:44:10,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:44:10,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908287505] [2025-03-16 19:44:10,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:44:10,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:44:10,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-16 19:44:10,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-16 19:44:10,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:44:10,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:44:11,164 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-16 19:44:11,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:44:11,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908287505] [2025-03-16 19:44:11,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908287505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:44:11,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:44:11,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:44:11,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180610399] [2025-03-16 19:44:11,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:44:11,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:44:11,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:44:11,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:44:11,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:44:11,166 INFO L87 Difference]: Start difference. First operand 307 states and 445 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-16 19:44:15,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:19,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-16 19:44:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:44:19,251 INFO L93 Difference]: Finished difference Result 561 states and 800 transitions. [2025-03-16 19:44:19,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:44:19,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 202 [2025-03-16 19:44:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:44:19,254 INFO L225 Difference]: With dead ends: 561 [2025-03-16 19:44:19,254 INFO L226 Difference]: Without dead ends: 281 [2025-03-16 19:44:19,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:44:19,257 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 126 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:44:19,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 603 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-03-16 19:44:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-16 19:44:19,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 277. [2025-03-16 19:44:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 180 states have (on average 1.2444444444444445) internal successors, (224), 180 states have internal predecessors, (224), 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-16 19:44:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 388 transitions. [2025-03-16 19:44:19,280 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 388 transitions. Word has length 202 [2025-03-16 19:44:19,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:44:19,280 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 388 transitions. [2025-03-16 19:44:19,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-16 19:44:19,280 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 388 transitions. [2025-03-16 19:44:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-16 19:44:19,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:44:19,283 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] [2025-03-16 19:44:19,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:44:19,283 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:44:19,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:44:19,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1659949270, now seen corresponding path program 1 times [2025-03-16 19:44:19,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:44:19,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098595902] [2025-03-16 19:44:19,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:44:19,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:44:19,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-16 19:44:19,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-16 19:44:19,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:44:19,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:44:19,794 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-16 19:44:19,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:44:19,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098595902] [2025-03-16 19:44:19,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098595902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:44:19,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043182449] [2025-03-16 19:44:19,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:44:19,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:44:19,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:44:19,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:44:19,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:44:20,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-16 19:44:20,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-16 19:44:20,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:44:20,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:44:20,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 1618 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 19:44:20,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:44:20,402 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-16 19:44:20,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:44:20,725 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-16 19:44:20,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043182449] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:44:20,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:44:20,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-16 19:44:20,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096021503] [2025-03-16 19:44:20,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:44:20,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:44:20,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:44:20,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:44:20,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:44:20,728 INFO L87 Difference]: Start difference. First operand 277 states and 388 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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-16 19:44:21,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:23,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:44:24,476 INFO L93 Difference]: Finished difference Result 561 states and 799 transitions. [2025-03-16 19:44:24,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:44:24,477 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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 202 [2025-03-16 19:44:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:44:24,479 INFO L225 Difference]: With dead ends: 561 [2025-03-16 19:44:24,479 INFO L226 Difference]: Without dead ends: 307 [2025-03-16 19:44:24,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 403 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-16 19:44:24,483 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 202 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:44:24,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 483 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-16 19:44:24,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-16 19:44:24,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 304. [2025-03-16 19:44:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 202 states have (on average 1.2623762376237624) internal successors, (255), 204 states have internal predecessors, (255), 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-16 19:44:24,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 421 transitions. [2025-03-16 19:44:24,510 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 421 transitions. Word has length 202 [2025-03-16 19:44:24,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:44:24,510 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 421 transitions. [2025-03-16 19:44:24,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 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-16 19:44:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 421 transitions. [2025-03-16 19:44:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-16 19:44:24,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:44:24,514 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] [2025-03-16 19:44:24,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 19:44:24,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:44:24,715 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:44:24,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:44:24,716 INFO L85 PathProgramCache]: Analyzing trace with hash 324444906, now seen corresponding path program 1 times [2025-03-16 19:44:24,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:44:24,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468888808] [2025-03-16 19:44:24,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:44:24,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:44:24,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-16 19:44:24,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-16 19:44:24,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:44:24,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:44:26,337 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-16 19:44:26,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:44:26,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468888808] [2025-03-16 19:44:26,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468888808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:44:26,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282197733] [2025-03-16 19:44:26,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:44:26,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:44:26,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:44:26,340 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:44:26,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 19:44:26,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-16 19:44:26,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-16 19:44:26,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:44:26,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:44:26,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 1716 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 19:44:26,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:44:27,016 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 13 treesize of output 9 [2025-03-16 19:44:32,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 19:44:32,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 19:44:32,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2025-03-16 19:44:36,853 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-03-16 19:44:36,854 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 25 treesize of output 24 [2025-03-16 19:44:48,374 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-16 19:44:48,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:44:48,612 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-16 19:44:48,617 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-16 19:44:49,078 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 20 treesize of output 18 [2025-03-16 19:44:49,082 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 26 treesize of output 22 [2025-03-16 19:44:49,148 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 20 treesize of output 18 [2025-03-16 19:44:49,152 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 26 treesize of output 22 [2025-03-16 19:44:49,223 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-16 19:44:49,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282197733] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:44:49,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:44:49,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 37 [2025-03-16 19:44:49,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677924714] [2025-03-16 19:44:49,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:44:49,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-16 19:44:49,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:44:49,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-16 19:44:49,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1192, Unknown=1, NotChecked=0, Total=1332 [2025-03-16 19:44:49,225 INFO L87 Difference]: Start difference. First operand 304 states and 421 transitions. Second operand has 37 states, 34 states have (on average 3.911764705882353) internal successors, (133), 34 states have internal predecessors, (133), 18 states have call successors, (64), 12 states have call predecessors, (64), 14 states have return successors, (64), 16 states have call predecessors, (64), 18 states have call successors, (64) [2025-03-16 19:44:53,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:58,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:45:00,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:45:05,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:45:09,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:45:13,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:45:18,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:45:23,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:45:28,178 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 []