./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_sync.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_sync.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 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:43:45,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:43:45,701 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:45,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:43:45,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:43:45,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:43:45,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:43:45,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:43:45,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:43:45,728 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:43:45,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:43:45,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:43:45,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:43:45,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:43:45,730 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:43:45,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:43:45,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:43:45,730 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:43:45,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:43:45,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:43:45,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:43:45,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:43:45,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:43:45,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:43:45,732 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 -> 459cf049271151c452003a0973bcdcc76c918d5759d842702be03de8528f67ef [2025-03-16 19:43:45,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:43:45,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:43:45,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:43:45,949 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:43:45,950 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:43:45,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_sync.i [2025-03-16 19:43:47,030 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e75f5eff/b2c658d1a1294b2c984aed8175014882/FLAG9a2c89a40 [2025-03-16 19:43:47,312 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:43:47,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_sync.i [2025-03-16 19:43:47,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e75f5eff/b2c658d1a1294b2c984aed8175014882/FLAG9a2c89a40 [2025-03-16 19:43:47,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e75f5eff/b2c658d1a1294b2c984aed8175014882 [2025-03-16 19:43:47,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:43:47,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:43:47,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:43:47,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:43:47,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:43:47,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:43:47" (1/1) ... [2025-03-16 19:43:47,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18e39f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:47, skipping insertion in model container [2025-03-16 19:43:47,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:43:47" (1/1) ... [2025-03-16 19:43:47,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:43:47,662 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_sync.i[34698,34711] [2025-03-16 19:43:47,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:43:47,730 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:43:47,760 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_sync.i[34698,34711] [2025-03-16 19:43:47,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:43:47,851 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:43:47,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:47 WrapperNode [2025-03-16 19:43:47,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:43:47,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:43:47,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:43:47,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:43:47,857 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:47" (1/1) ... [2025-03-16 19:43:47,883 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:47" (1/1) ... [2025-03-16 19:43:47,915 INFO L138 Inliner]: procedures = 245, calls = 253, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 551 [2025-03-16 19:43:47,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:43:47,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:43:47,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:43:47,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:43:47,930 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:47" (1/1) ... [2025-03-16 19:43:47,930 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:47" (1/1) ... [2025-03-16 19:43:47,939 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:47" (1/1) ... [2025-03-16 19:43:47,966 INFO L175 MemorySlicer]: Split 126 memory accesses to 17 slices as follows [2, 7, 8, 8, 8, 20, 16, 3, 12, 0, 7, 8, 3, 6, 3, 3, 12]. 16 percent of accesses are in the largest equivalence class. The 33 initializations are split as follows [2, 0, 3, 3, 3, 6, 6, 0, 2, 0, 0, 4, 0, 2, 0, 0, 2]. The 38 writes are split as follows [0, 1, 2, 2, 2, 8, 5, 1, 4, 0, 1, 2, 1, 2, 1, 1, 5]. [2025-03-16 19:43:47,966 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:47" (1/1) ... [2025-03-16 19:43:47,966 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:47" (1/1) ... [2025-03-16 19:43:47,983 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:47" (1/1) ... [2025-03-16 19:43:47,984 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:47" (1/1) ... [2025-03-16 19:43:47,988 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:47" (1/1) ... [2025-03-16 19:43:47,990 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:47" (1/1) ... [2025-03-16 19:43:47,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:43:47,996 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:43:47,996 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:43:47,996 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:43:47,997 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:47" (1/1) ... [2025-03-16 19:43:48,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:43:48,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:48,024 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:48,028 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:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 19:43:48,047 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 19:43:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 19:43:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_signal [2025-03-16 19:43:48,047 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_signal [2025-03-16 19:43:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-03-16 19:43:48,048 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-03-16 19:43:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 19:43:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 19:43:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 19:43:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-16 19:43:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-16 19:43:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-16 19:43:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-16 19:43:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-16 19:43:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-16 19:43:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-16 19:43:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-16 19:43:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-16 19:43:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-16 19:43:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-16 19:43:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-16 19:43:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-16 19:43:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-16 19:43:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 19:43:48,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 19:43:48,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 19:43:48,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 19:43:48,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-16 19:43:48,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-16 19:43:48,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-16 19:43:48,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-16 19:43:48,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-16 19:43:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-16 19:43:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-16 19:43:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-16 19:43:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-16 19:43:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-16 19:43:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-16 19:43:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-16 19:43:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-16 19:43:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-16 19:43:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-03-16 19:43:48,053 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-03-16 19:43:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 19:43:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 19:43:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 19:43:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 19:43:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-16 19:43:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-16 19:43:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-16 19:43:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-16 19:43:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-16 19:43:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-16 19:43:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-16 19:43:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-16 19:43:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-16 19:43:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-16 19:43:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-16 19:43:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-16 19:43:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-16 19:43:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_init [2025-03-16 19:43:48,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_init [2025-03-16 19:43:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 19:43:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 19:43:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 19:43:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-16 19:43:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-16 19:43:48,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_wait [2025-03-16 19:43:48,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_wait [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-16 19:43:48,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:43:48,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-16 19:43:48,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 19:43:48,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-16 19:43:48,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-16 19:43:48,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:43:48,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:43:48,247 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:43:48,249 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:43:48,606 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-16 19:43:48,606 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:48,606 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L987-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:48,606 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-16 19:43:48,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:48,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:48,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-16 19:43:48,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:43:48,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:43:48,833 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2025-03-16 19:43:48,834 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:43:48,848 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:43:48,848 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:43:48,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:43:48 BoogieIcfgContainer [2025-03-16 19:43:48,849 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:43:48,850 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:43:48,850 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:43:48,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:43:48,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:43:47" (1/3) ... [2025-03-16 19:43:48,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45eb9bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:43:48, skipping insertion in model container [2025-03-16 19:43:48,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:43:47" (2/3) ... [2025-03-16 19:43:48,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45eb9bdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:43:48, skipping insertion in model container [2025-03-16 19:43:48,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:43:48" (3/3) ... [2025-03-16 19:43:48,856 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_sync.i [2025-03-16 19:43:48,865 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:43:48,866 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_sync.i that has 11 procedures, 183 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-16 19:43:48,913 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:43:48,922 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;@47926f73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:43:48,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:43:48,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 116 states have (on average 1.4655172413793103) internal successors, (170), 117 states have internal predecessors, (170), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-16 19:43:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:43:48,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:48,938 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:48,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:48,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1281459082, now seen corresponding path program 1 times [2025-03-16 19:43:48,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:48,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113577118] [2025-03-16 19:43:48,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:48,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:49,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:43:49,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:43:49,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:49,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:49,358 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-16 19:43:49,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:49,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113577118] [2025-03-16 19:43:49,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113577118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:49,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:49,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:43:49,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375547045] [2025-03-16 19:43:49,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:49,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:43:49,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:49,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:43:49,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:43:49,376 INFO L87 Difference]: Start difference. First operand has 183 states, 116 states have (on average 1.4655172413793103) internal successors, (170), 117 states have internal predecessors, (170), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-16 19:43:49,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:49,496 INFO L93 Difference]: Finished difference Result 365 states and 602 transitions. [2025-03-16 19:43:49,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:43:49,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 70 [2025-03-16 19:43:49,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:49,508 INFO L225 Difference]: With dead ends: 365 [2025-03-16 19:43:49,510 INFO L226 Difference]: Without dead ends: 182 [2025-03-16 19:43:49,517 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:49,519 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:49,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 543 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:43:49,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-16 19:43:49,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2025-03-16 19:43:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 115 states have (on average 1.4260869565217391) internal successors, (164), 115 states have internal predecessors, (164), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-16 19:43:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 274 transitions. [2025-03-16 19:43:49,572 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 274 transitions. Word has length 70 [2025-03-16 19:43:49,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:49,572 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 274 transitions. [2025-03-16 19:43:49,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-16 19:43:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 274 transitions. [2025-03-16 19:43:49,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:43:49,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:49,576 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:43:49,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:49,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:49,580 INFO L85 PathProgramCache]: Analyzing trace with hash 803365838, now seen corresponding path program 1 times [2025-03-16 19:43:49,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:49,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218254572] [2025-03-16 19:43:49,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:49,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:49,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:43:49,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:43:49,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:49,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-16 19:43:49,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:49,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218254572] [2025-03-16 19:43:49,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218254572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:49,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:49,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:43:49,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586876801] [2025-03-16 19:43:49,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:49,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:43:49,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:49,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:43:49,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:43:49,789 INFO L87 Difference]: Start difference. First operand 181 states and 274 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-16 19:43:49,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:49,833 INFO L93 Difference]: Finished difference Result 361 states and 548 transitions. [2025-03-16 19:43:49,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:43:49,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2025-03-16 19:43:49,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:49,838 INFO L225 Difference]: With dead ends: 361 [2025-03-16 19:43:49,838 INFO L226 Difference]: Without dead ends: 182 [2025-03-16 19:43:49,839 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:49,842 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 0 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 541 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:49,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 541 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:49,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-16 19:43:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-03-16 19:43:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 116 states have (on average 1.4224137931034482) internal successors, (165), 116 states have internal predecessors, (165), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-16 19:43:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 275 transitions. [2025-03-16 19:43:49,855 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 275 transitions. Word has length 72 [2025-03-16 19:43:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:49,856 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 275 transitions. [2025-03-16 19:43:49,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-16 19:43:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 275 transitions. [2025-03-16 19:43:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:43:49,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:49,858 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:43:49,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:49,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:49,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1250141966, now seen corresponding path program 1 times [2025-03-16 19:43:49,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:49,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436281311] [2025-03-16 19:43:49,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:49,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:49,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:43:49,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:43:49,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:49,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-16 19:43:50,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:50,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436281311] [2025-03-16 19:43:50,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436281311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:50,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815576677] [2025-03-16 19:43:50,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:50,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:50,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:50,067 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:50,068 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:50,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:43:50,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:43:50,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:50,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:50,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:43:50,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-16 19:43:50,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:43:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-16 19:43:50,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815576677] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:43:50,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:43:50,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 19:43:50,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367721407] [2025-03-16 19:43:50,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:43:50,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:43:50,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:50,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:43:50,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:43:50,474 INFO L87 Difference]: Start difference. First operand 182 states and 275 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-16 19:43:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:50,527 INFO L93 Difference]: Finished difference Result 364 states and 552 transitions. [2025-03-16 19:43:50,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:43:50,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 73 [2025-03-16 19:43:50,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:50,531 INFO L225 Difference]: With dead ends: 364 [2025-03-16 19:43:50,532 INFO L226 Difference]: Without dead ends: 184 [2025-03-16 19:43:50,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 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:50,533 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 0 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:50,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 810 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:43:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-16 19:43:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-03-16 19:43:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 118 states have (on average 1.4152542372881356) internal successors, (167), 118 states have internal predecessors, (167), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-16 19:43:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 277 transitions. [2025-03-16 19:43:50,555 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 277 transitions. Word has length 73 [2025-03-16 19:43:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:50,555 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 277 transitions. [2025-03-16 19:43:50,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-16 19:43:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 277 transitions. [2025-03-16 19:43:50,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:43:50,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:50,558 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2025-03-16 19:43:50,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:43:50,764 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:50,764 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:50,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:50,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1779582066, now seen corresponding path program 2 times [2025-03-16 19:43:50,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:50,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234302952] [2025-03-16 19:43:50,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:43:50,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:50,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-03-16 19:43:50,837 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 75 statements. [2025-03-16 19:43:50,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:43:50,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-16 19:43:50,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:50,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234302952] [2025-03-16 19:43:50,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234302952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:50,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:50,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:43:50,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497008974] [2025-03-16 19:43:50,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:50,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:43:50,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:50,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:43:50,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:43:50,990 INFO L87 Difference]: Start difference. First operand 184 states and 277 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-16 19:43:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:51,044 INFO L93 Difference]: Finished difference Result 359 states and 550 transitions. [2025-03-16 19:43:51,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:43:51,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2025-03-16 19:43:51,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:51,048 INFO L225 Difference]: With dead ends: 359 [2025-03-16 19:43:51,048 INFO L226 Difference]: Without dead ends: 333 [2025-03-16 19:43:51,052 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:51,052 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 236 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 865 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:51,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 865 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:51,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-16 19:43:51,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2025-03-16 19:43:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 212 states have (on average 1.4386792452830188) internal successors, (305), 212 states have internal predecessors, (305), 99 states have call successors, (99), 20 states have call predecessors, (99), 20 states have return successors, (107), 99 states have call predecessors, (107), 99 states have call successors, (107) [2025-03-16 19:43:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 511 transitions. [2025-03-16 19:43:51,084 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 511 transitions. Word has length 75 [2025-03-16 19:43:51,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:51,084 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 511 transitions. [2025-03-16 19:43:51,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-16 19:43:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 511 transitions. [2025-03-16 19:43:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-16 19:43:51,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:51,090 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 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] [2025-03-16 19:43:51,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:43:51,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:51,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:51,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1888647007, now seen corresponding path program 1 times [2025-03-16 19:43:51,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:51,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887738108] [2025-03-16 19:43:51,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:51,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:51,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 19:43:51,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 19:43:51,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:51,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2025-03-16 19:43:51,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:51,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887738108] [2025-03-16 19:43:51,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887738108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:51,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961082482] [2025-03-16 19:43:51,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:51,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:51,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:51,358 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:51,360 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:51,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 19:43:51,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 19:43:51,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:51,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:51,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:43:51,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2025-03-16 19:43:51,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:43:51,862 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2025-03-16 19:43:51,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961082482] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:43:51,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:43:51,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 5 [2025-03-16 19:43:51,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067274462] [2025-03-16 19:43:51,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:43:51,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:51,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:51,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:51,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:51,864 INFO L87 Difference]: Start difference. First operand 332 states and 511 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-16 19:43:51,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:51,985 INFO L93 Difference]: Finished difference Result 662 states and 1020 transitions. [2025-03-16 19:43:51,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:43:51,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 169 [2025-03-16 19:43:51,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:51,992 INFO L225 Difference]: With dead ends: 662 [2025-03-16 19:43:51,992 INFO L226 Difference]: Without dead ends: 337 [2025-03-16 19:43:51,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 335 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:51,996 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 2 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:51,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 538 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:43:51,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-16 19:43:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-03-16 19:43:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 217 states have (on average 1.433179723502304) internal successors, (311), 217 states have internal predecessors, (311), 99 states have call successors, (99), 20 states have call predecessors, (99), 20 states have return successors, (107), 99 states have call predecessors, (107), 99 states have call successors, (107) [2025-03-16 19:43:52,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 517 transitions. [2025-03-16 19:43:52,022 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 517 transitions. Word has length 169 [2025-03-16 19:43:52,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:52,022 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 517 transitions. [2025-03-16 19:43:52,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-16 19:43:52,022 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 517 transitions. [2025-03-16 19:43:52,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-16 19:43:52,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:52,026 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-03-16 19:43:52,034 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:43:52,226 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:43:52,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:52,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:52,227 INFO L85 PathProgramCache]: Analyzing trace with hash 647017343, now seen corresponding path program 1 times [2025-03-16 19:43:52,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:52,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143383283] [2025-03-16 19:43:52,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:52,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:52,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-16 19:43:52,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-16 19:43:52,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:52,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-16 19:43:52,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:52,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143383283] [2025-03-16 19:43:52,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143383283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:52,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:52,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:43:52,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111503441] [2025-03-16 19:43:52,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:52,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:52,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:52,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:52,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:52,855 INFO L87 Difference]: Start difference. First operand 337 states and 517 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-16 19:43:56,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:57,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:57,134 INFO L93 Difference]: Finished difference Result 703 states and 1085 transitions. [2025-03-16 19:43:57,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:43:57,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 189 [2025-03-16 19:43:57,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:57,141 INFO L225 Difference]: With dead ends: 703 [2025-03-16 19:43:57,142 INFO L226 Difference]: Without dead ends: 673 [2025-03-16 19:43:57,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:57,144 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 275 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:57,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1134 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 76 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-16 19:43:57,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-16 19:43:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 665. [2025-03-16 19:43:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 424 states have (on average 1.4339622641509433) internal successors, (608), 427 states have internal predecessors, (608), 197 states have call successors, (197), 40 states have call predecessors, (197), 43 states have return successors, (231), 197 states have call predecessors, (231), 197 states have call successors, (231) [2025-03-16 19:43:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1036 transitions. [2025-03-16 19:43:57,195 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1036 transitions. Word has length 189 [2025-03-16 19:43:57,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:57,196 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 1036 transitions. [2025-03-16 19:43:57,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-16 19:43:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1036 transitions. [2025-03-16 19:43:57,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-16 19:43:57,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:57,200 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-03-16 19:43:57,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:43:57,200 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:57,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:57,201 INFO L85 PathProgramCache]: Analyzing trace with hash -432816149, now seen corresponding path program 1 times [2025-03-16 19:43:57,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:57,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227003414] [2025-03-16 19:43:57,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:57,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:57,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-16 19:43:57,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-16 19:43:57,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:57,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-16 19:43:57,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:57,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227003414] [2025-03-16 19:43:57,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227003414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:57,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:57,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:43:57,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247295118] [2025-03-16 19:43:57,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:57,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:43:57,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:57,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:43:57,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:43:57,628 INFO L87 Difference]: Start difference. First operand 665 states and 1036 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 19:43:57,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:57,822 INFO L93 Difference]: Finished difference Result 1092 states and 1677 transitions. [2025-03-16 19:43:57,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:43:57,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 189 [2025-03-16 19:43:57,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:57,826 INFO L225 Difference]: With dead ends: 1092 [2025-03-16 19:43:57,826 INFO L226 Difference]: Without dead ends: 661 [2025-03-16 19:43:57,828 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:43:57,828 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 258 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:57,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 889 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:43:57,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-03-16 19:43:57,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 654. [2025-03-16 19:43:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 416 states have (on average 1.4326923076923077) internal successors, (596), 418 states have internal predecessors, (596), 195 states have call successors, (195), 40 states have call predecessors, (195), 42 states have return successors, (223), 195 states have call predecessors, (223), 195 states have call successors, (223) [2025-03-16 19:43:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1014 transitions. [2025-03-16 19:43:57,890 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1014 transitions. Word has length 189 [2025-03-16 19:43:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:57,890 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 1014 transitions. [2025-03-16 19:43:57,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-16 19:43:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1014 transitions. [2025-03-16 19:43:57,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-16 19:43:57,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:57,895 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 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] [2025-03-16 19:43:57,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:43:57,895 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:57,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:57,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1966701765, now seen corresponding path program 1 times [2025-03-16 19:43:57,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:57,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793560631] [2025-03-16 19:43:57,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:57,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:57,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-16 19:43:58,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-16 19:43:58,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:58,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2025-03-16 19:43:58,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:58,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793560631] [2025-03-16 19:43:58,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793560631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:58,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:58,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:43:58,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527019199] [2025-03-16 19:43:58,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:58,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:43:58,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:58,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:43:58,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:43:58,333 INFO L87 Difference]: Start difference. First operand 654 states and 1014 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-16 19:44:02,391 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:02,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:44:02,474 INFO L93 Difference]: Finished difference Result 1227 states and 1887 transitions. [2025-03-16 19:44:02,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:44:02,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 174 [2025-03-16 19:44:02,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:44:02,480 INFO L225 Difference]: With dead ends: 1227 [2025-03-16 19:44:02,480 INFO L226 Difference]: Without dead ends: 571 [2025-03-16 19:44:02,482 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:02,482 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 254 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:44:02,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 890 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 19:44:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-16 19:44:02,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 567. [2025-03-16 19:44:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 362 states have (on average 1.3646408839779005) internal successors, (494), 364 states have internal predecessors, (494), 168 states have call successors, (168), 35 states have call predecessors, (168), 36 states have return successors, (188), 167 states have call predecessors, (188), 168 states have call successors, (188) [2025-03-16 19:44:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 850 transitions. [2025-03-16 19:44:02,517 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 850 transitions. Word has length 174 [2025-03-16 19:44:02,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:44:02,517 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 850 transitions. [2025-03-16 19:44:02,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-16 19:44:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 850 transitions. [2025-03-16 19:44:02,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-16 19:44:02,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:44:02,520 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 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] [2025-03-16 19:44:02,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:44:02,520 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:44:02,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:44:02,521 INFO L85 PathProgramCache]: Analyzing trace with hash -635065573, now seen corresponding path program 1 times [2025-03-16 19:44:02,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:44:02,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913441941] [2025-03-16 19:44:02,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:44:02,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:44:02,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-16 19:44:02,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-16 19:44:02,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:44:02,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:44:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2025-03-16 19:44:02,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:44:02,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913441941] [2025-03-16 19:44:02,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913441941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:44:02,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:44:02,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:44:02,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151609797] [2025-03-16 19:44:02,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:44:02,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:44:02,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:44:02,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:44:02,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:44:02,947 INFO L87 Difference]: Start difference. First operand 567 states and 850 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-16 19:44:03,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:44:03,095 INFO L93 Difference]: Finished difference Result 608 states and 899 transitions. [2025-03-16 19:44:03,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:44:03,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 174 [2025-03-16 19:44:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:44:03,099 INFO L225 Difference]: With dead ends: 608 [2025-03-16 19:44:03,099 INFO L226 Difference]: Without dead ends: 535 [2025-03-16 19:44:03,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:44:03,100 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 257 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:44:03,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 1141 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:44:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-16 19:44:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 531. [2025-03-16 19:44:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 342 states have (on average 1.3625730994152048) internal successors, (466), 343 states have internal predecessors, (466), 152 states have call successors, (152), 35 states have call predecessors, (152), 36 states have return successors, (171), 152 states have call predecessors, (171), 152 states have call successors, (171) [2025-03-16 19:44:03,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 789 transitions. [2025-03-16 19:44:03,124 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 789 transitions. Word has length 174 [2025-03-16 19:44:03,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:44:03,125 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 789 transitions. [2025-03-16 19:44:03,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-16 19:44:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 789 transitions. [2025-03-16 19:44:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-16 19:44:03,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:44:03,142 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-03-16 19:44:03,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:44:03,143 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:44:03,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:44:03,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1392242777, now seen corresponding path program 1 times [2025-03-16 19:44:03,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:44:03,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193849298] [2025-03-16 19:44:03,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:44:03,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:44:03,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-16 19:44:03,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-16 19:44:03,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:44:03,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:44:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-16 19:44:03,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:44:03,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193849298] [2025-03-16 19:44:03,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193849298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:44:03,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:44:03,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:44:03,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965632452] [2025-03-16 19:44:03,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:44:03,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:44:03,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:44:03,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:44:03,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:44:03,954 INFO L87 Difference]: Start difference. First operand 531 states and 789 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-16 19:44:08,022 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:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:44:08,312 INFO L93 Difference]: Finished difference Result 578 states and 847 transitions. [2025-03-16 19:44:08,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:44:08,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 189 [2025-03-16 19:44:08,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:44:08,316 INFO L225 Difference]: With dead ends: 578 [2025-03-16 19:44:08,316 INFO L226 Difference]: Without dead ends: 478 [2025-03-16 19:44:08,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:44:08,317 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 235 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:44:08,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1090 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 191 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-16 19:44:08,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-16 19:44:08,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 468. [2025-03-16 19:44:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 300 states have (on average 1.36) internal successors, (408), 301 states have internal predecessors, (408), 136 states have call successors, (136), 29 states have call predecessors, (136), 31 states have return successors, (154), 137 states have call predecessors, (154), 136 states have call successors, (154) [2025-03-16 19:44:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 698 transitions. [2025-03-16 19:44:08,355 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 698 transitions. Word has length 189 [2025-03-16 19:44:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:44:08,355 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 698 transitions. [2025-03-16 19:44:08,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-16 19:44:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 698 transitions. [2025-03-16 19:44:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-16 19:44:08,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:44:08,360 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 6, 2, 2, 2, 2, 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] [2025-03-16 19:44:08,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:44:08,360 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:44:08,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:44:08,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1612169912, now seen corresponding path program 1 times [2025-03-16 19:44:08,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:44:08,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962380387] [2025-03-16 19:44:08,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:44:08,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:44:08,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-16 19:44:08,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-16 19:44:08,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:44:08,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:44:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-03-16 19:44:08,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:44:08,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962380387] [2025-03-16 19:44:08,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962380387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:44:08,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068600335] [2025-03-16 19:44:08,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:44:08,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:44:08,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:44:08,781 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:08,782 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:09,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-16 19:44:09,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-16 19:44:09,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:44:09,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:44:09,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 1629 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 19:44:09,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:44:09,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 640 proven. 4 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2025-03-16 19:44:09,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:44:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-03-16 19:44:09,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068600335] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:44:09,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:44:09,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-16 19:44:09,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639400178] [2025-03-16 19:44:09,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:44:09,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:44:09,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:44:09,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:44:09,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:44:09,970 INFO L87 Difference]: Start difference. First operand 468 states and 698 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 9 states have call successors, (51), 5 states have call predecessors, (51), 6 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) [2025-03-16 19:44:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:44:11,796 INFO L93 Difference]: Finished difference Result 1186 states and 1797 transitions. [2025-03-16 19:44:11,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:44:11,796 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 9 states have call successors, (51), 5 states have call predecessors, (51), 6 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) Word has length 253 [2025-03-16 19:44:11,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:44:11,801 INFO L225 Difference]: With dead ends: 1186 [2025-03-16 19:44:11,801 INFO L226 Difference]: Without dead ends: 752 [2025-03-16 19:44:11,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 506 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:11,804 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 428 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:44:11,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1173 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 19:44:11,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-03-16 19:44:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 735. [2025-03-16 19:44:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 469 states have (on average 1.3837953091684434) internal successors, (649), 472 states have internal predecessors, (649), 212 states have call successors, (212), 51 states have call predecessors, (212), 53 states have return successors, (244), 211 states have call predecessors, (244), 212 states have call successors, (244) [2025-03-16 19:44:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1105 transitions. [2025-03-16 19:44:11,838 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1105 transitions. Word has length 253 [2025-03-16 19:44:11,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:44:11,838 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1105 transitions. [2025-03-16 19:44:11,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 9 states have call successors, (51), 5 states have call predecessors, (51), 6 states have return successors, (52), 7 states have call predecessors, (52), 9 states have call successors, (52) [2025-03-16 19:44:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1105 transitions. [2025-03-16 19:44:11,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-16 19:44:11,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:44:11,843 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 8, 8, 8, 8, 8, 8, 8, 8, 6, 2, 2, 2, 2, 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] [2025-03-16 19:44:11,862 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:12,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:44:12,044 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:44:12,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:44:12,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1371405064, now seen corresponding path program 1 times [2025-03-16 19:44:12,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:44:12,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948642884] [2025-03-16 19:44:12,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:44:12,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:44:12,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-16 19:44:12,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-16 19:44:12,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:44:12,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:44:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-03-16 19:44:13,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:44:13,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948642884] [2025-03-16 19:44:13,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948642884] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:44:13,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933390506] [2025-03-16 19:44:13,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:44:13,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:44:13,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:44:13,377 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:13,377 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:13,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-16 19:44:13,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-16 19:44:13,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:44:13,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:44:13,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 1727 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-16 19:44:13,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:44:14,102 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:16,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 19:44:16,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 19:44:16,895 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:17,622 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-03-16 19:44:17,622 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:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 1031 proven. 4 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2025-03-16 19:44:30,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:44:30,635 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:30,638 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:31,004 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:31,006 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:31,050 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:31,052 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:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1534 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-03-16 19:44:31,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933390506] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:44:31,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:44:31,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 37 [2025-03-16 19:44:31,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111344875] [2025-03-16 19:44:31,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:44:31,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-16 19:44:31,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:44:31,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-16 19:44:31,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1192, Unknown=2, NotChecked=0, Total=1332 [2025-03-16 19:44:31,225 INFO L87 Difference]: Start difference. First operand 735 states and 1105 transitions. Second operand has 37 states, 34 states have (on average 4.617647058823529) internal successors, (157), 35 states have internal predecessors, (157), 18 states have call successors, (70), 12 states have call predecessors, (70), 14 states have return successors, (70), 16 states have call predecessors, (70), 18 states have call successors, (70) [2025-03-16 19:44:35,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:39,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 19:44:43,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:49,279 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:53,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:44:53,548 INFO L93 Difference]: Finished difference Result 1445 states and 2222 transitions. [2025-03-16 19:44:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-16 19:44:53,549 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 4.617647058823529) internal successors, (157), 35 states have internal predecessors, (157), 18 states have call successors, (70), 12 states have call predecessors, (70), 14 states have return successors, (70), 16 states have call predecessors, (70), 18 states have call successors, (70) Word has length 253 [2025-03-16 19:44:53,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:44:53,555 INFO L225 Difference]: With dead ends: 1445 [2025-03-16 19:44:53,555 INFO L226 Difference]: Without dead ends: 829 [2025-03-16 19:44:53,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 483 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=671, Invalid=3487, Unknown=2, NotChecked=0, Total=4160 [2025-03-16 19:44:53,559 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 1379 mSDsluCounter, 2133 mSDsCounter, 0 mSdLazyCounter, 3483 mSolverCounterSat, 1164 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 2368 SdHoareTripleChecker+Invalid, 4650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1164 IncrementalHoareTripleChecker+Valid, 3483 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:44:53,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 2368 Invalid, 4650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1164 Valid, 3483 Invalid, 3 Unknown, 0 Unchecked, 21.1s Time] [2025-03-16 19:44:53,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-03-16 19:44:53,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 782. [2025-03-16 19:44:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 497 states have (on average 1.380281690140845) internal successors, (686), 503 states have internal predecessors, (686), 226 states have call successors, (226), 51 states have call predecessors, (226), 58 states have return successors, (283), 227 states have call predecessors, (283), 226 states have call successors, (283) [2025-03-16 19:44:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1195 transitions. [2025-03-16 19:44:53,625 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1195 transitions. Word has length 253 [2025-03-16 19:44:53,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:44:53,626 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1195 transitions. [2025-03-16 19:44:53,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 4.617647058823529) internal successors, (157), 35 states have internal predecessors, (157), 18 states have call successors, (70), 12 states have call predecessors, (70), 14 states have return successors, (70), 16 states have call predecessors, (70), 18 states have call successors, (70) [2025-03-16 19:44:53,627 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1195 transitions. [2025-03-16 19:44:53,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-16 19:44:53,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:44:53,632 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 9, 9, 9, 9, 9, 9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 19:44:53,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 19:44:53,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:44:53,833 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:44:53,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:44:53,833 INFO L85 PathProgramCache]: Analyzing trace with hash -562366445, now seen corresponding path program 1 times [2025-03-16 19:44:53,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:44:53,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152366132] [2025-03-16 19:44:53,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:44:53,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:44:53,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-16 19:44:53,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-16 19:44:53,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:44:53,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:44:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1810 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1798 trivial. 0 not checked. [2025-03-16 19:44:55,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:44:55,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152366132] [2025-03-16 19:44:55,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152366132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:44:55,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746402344] [2025-03-16 19:44:55,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:44:55,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:44:55,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:44:55,634 INFO L229 MonitoredProcess]: Starting monitored process 6 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:55,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 19:44:55,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-16 19:44:56,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-16 19:44:56,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:44:56,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:44:56,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 1937 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-16 19:44:56,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:44:56,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-16 19:44:58,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 19:44:58,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 19:44:58,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 50 [2025-03-16 19:44:58,597 INFO L349 Elim1Store]: treesize reduction 58, result has 61.3 percent of original size [2025-03-16 19:44:58,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 122 [2025-03-16 19:44:59,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 19:44:59,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2025-03-16 19:44:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1810 backedges. 1065 proven. 242 refuted. 0 times theorem prover too weak. 503 trivial. 0 not checked. [2025-03-16 19:44:59,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:44:59,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2025-03-16 19:44:59,697 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 142 treesize of output 134 [2025-03-16 19:45:00,093 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 21 treesize of output 19 [2025-03-16 19:45:00,096 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 30 treesize of output 26 [2025-03-16 19:45:00,181 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 21 treesize of output 19 [2025-03-16 19:45:00,184 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 30 treesize of output 26 [2025-03-16 19:45:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1810 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1798 trivial. 0 not checked. [2025-03-16 19:45:00,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746402344] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:45:00,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:45:00,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 14] total 40 [2025-03-16 19:45:00,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263272607] [2025-03-16 19:45:00,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:45:00,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-16 19:45:00,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:45:00,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-16 19:45:00,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1383, Unknown=2, NotChecked=0, Total=1560 [2025-03-16 19:45:00,451 INFO L87 Difference]: Start difference. First operand 782 states and 1195 transitions. Second operand has 40 states, 36 states have (on average 4.777777777777778) internal successors, (172), 37 states have internal predecessors, (172), 20 states have call successors, (73), 12 states have call predecessors, (73), 15 states have return successors, (73), 18 states have call predecessors, (73), 20 states have call successors, (73) [2025-03-16 19:45:02,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-16 19:45:06,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 19:45:10,083 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 [0] [2025-03-16 19:45:14,978 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 [0] [2025-03-16 19:45:17,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]