./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_fib_longer-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_fib_longer-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6c9b52ffa673147438276e1d7b786b060eda002f60ced6e1594740d0a0004b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:42:24,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:42:24,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:42:24,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:42:24,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:42:24,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:42:24,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:42:24,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:42:24,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:42:24,609 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:42:24,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:42:24,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:42:24,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:42:24,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:42:24,609 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:42:24,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:42:24,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:42:24,610 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:42:24,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:42:24,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:42:24,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:42:24,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:42:24,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:42:24,610 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:42:24,610 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:42:24,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:42:24,610 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:42:24,610 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:42:24,610 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:42:24,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:42:24,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:42:24,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:42:24,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:42:24,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:42:24,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:42:24,611 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:42:24,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:42:24,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:42:24,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:42:24,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:42:24,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:42:24,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:42:24,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:42:24,611 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 -> f6c9b52ffa673147438276e1d7b786b060eda002f60ced6e1594740d0a0004b3 [2025-03-16 19:42:24,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:42:24,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:42:24,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:42:24,850 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:42:24,850 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:42:24,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_fib_longer-1.i [2025-03-16 19:42:26,059 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8f71112a/f067b11b46d0435583f90752ae8fa148/FLAGe240503be [2025-03-16 19:42:26,361 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:42:26,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_fib_longer-1.i [2025-03-16 19:42:26,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8f71112a/f067b11b46d0435583f90752ae8fa148/FLAGe240503be [2025-03-16 19:42:26,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8f71112a/f067b11b46d0435583f90752ae8fa148 [2025-03-16 19:42:26,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:42:26,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:42:26,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:42:26,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:42:26,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:42:26,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:42:26" (1/1) ... [2025-03-16 19:42:26,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7901dc27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:26, skipping insertion in model container [2025-03-16 19:42:26,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:42:26" (1/1) ... [2025-03-16 19:42:26,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:42:26,889 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_fib_longer-1.i[23609,23622] [2025-03-16 19:42:26,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:42:26,987 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:42:27,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_fib_longer-1.i[23609,23622] [2025-03-16 19:42:27,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:42:27,106 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:42:27,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27 WrapperNode [2025-03-16 19:42:27,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:42:27,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:42:27,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:42:27,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:42:27,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,167 INFO L138 Inliner]: procedures = 145, calls = 446, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 777 [2025-03-16 19:42:27,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:42:27,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:42:27,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:42:27,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:42:27,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,218 INFO L175 MemorySlicer]: Split 310 memory accesses to 15 slices as follows [2, 8, 8, 37, 8, 62, 57, 25, 13, 25, 11, 0, 4, 37, 13]. 20 percent of accesses are in the largest equivalence class. The 76 initializations are split as follows [2, 3, 3, 0, 3, 21, 21, 7, 0, 7, 7, 0, 2, 0, 0]. The 71 writes are split as follows [0, 2, 2, 1, 2, 23, 18, 8, 1, 8, 2, 0, 2, 1, 1]. [2025-03-16 19:42:27,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,258 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:42:27,285 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:42:27,285 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:42:27,285 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:42:27,286 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:42:27,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:27,313 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:42:27,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-16 19:42:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 19:42:27,335 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-16 19:42:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-16 19:42:27,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-16 19:42:27,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-16 19:42:27,337 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-16 19:42:27,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-16 19:42:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 19:42:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 19:42:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 19:42:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-16 19:42:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-16 19:42:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-16 19:42:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-16 19:42:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-16 19:42:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-16 19:42:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-16 19:42:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-16 19:42:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-16 19:42:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-16 19:42:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-16 19:42:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-16 19:42:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:42:27,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:42:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 19:42:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-16 19:42:27,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 19:42:27,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:42:27,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:42:27,535 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:42:27,537 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:42:27,797 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-16 19:42:27,798 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:27,798 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:27,798 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-16 19:42:27,798 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:27,798 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:27,798 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-16 19:42:27,799 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-16 19:42:27,799 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:32,195 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-16 19:42:32,196 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:42:32,209 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:42:32,210 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:42:32,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:42:32 BoogieIcfgContainer [2025-03-16 19:42:32,211 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:42:32,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:42:32,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:42:32,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:42:32,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:42:26" (1/3) ... [2025-03-16 19:42:32,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6546b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:42:32, skipping insertion in model container [2025-03-16 19:42:32,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (2/3) ... [2025-03-16 19:42:32,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6546b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:42:32, skipping insertion in model container [2025-03-16 19:42:32,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:42:32" (3/3) ... [2025-03-16 19:42:32,217 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_fib_longer-1.i [2025-03-16 19:42:32,226 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:42:32,227 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_fib_longer-1.i that has 5 procedures, 181 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-16 19:42:32,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:42:32,300 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;@2ff0a154, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:42:32,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:42:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 108 states have (on average 1.3055555555555556) internal successors, (141), 109 states have internal predecessors, (141), 67 states have call successors, (67), 4 states have call predecessors, (67), 4 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-16 19:42:32,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-16 19:42:32,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:32,322 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:42:32,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:32,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:32,326 INFO L85 PathProgramCache]: Analyzing trace with hash 675062362, now seen corresponding path program 1 times [2025-03-16 19:42:32,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:32,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771328494] [2025-03-16 19:42:32,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:32,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:32,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-16 19:42:32,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-16 19:42:32,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:32,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-16 19:42:33,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:33,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771328494] [2025-03-16 19:42:33,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771328494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:33,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:33,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:42:33,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368405931] [2025-03-16 19:42:33,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:33,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:42:33,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:33,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:42:33,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:33,311 INFO L87 Difference]: Start difference. First operand has 181 states, 108 states have (on average 1.3055555555555556) internal successors, (141), 109 states have internal predecessors, (141), 67 states have call successors, (67), 4 states have call predecessors, (67), 4 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-16 19:42:37,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:42:37,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:37,426 INFO L93 Difference]: Finished difference Result 361 states and 614 transitions. [2025-03-16 19:42:37,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:42:37,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 298 [2025-03-16 19:42:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:37,436 INFO L225 Difference]: With dead ends: 361 [2025-03-16 19:42:37,437 INFO L226 Difference]: Without dead ends: 180 [2025-03-16 19:42:37,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:37,445 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 2 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:37,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 537 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 19:42:37,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-16 19:42:37,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2025-03-16 19:42:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 107 states have (on average 1.280373831775701) internal successors, (137), 107 states have internal predecessors, (137), 67 states have call successors, (67), 4 states have call predecessors, (67), 4 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-16 19:42:37,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 271 transitions. [2025-03-16 19:42:37,498 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 271 transitions. Word has length 298 [2025-03-16 19:42:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:37,498 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 271 transitions. [2025-03-16 19:42:37,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-16 19:42:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 271 transitions. [2025-03-16 19:42:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-16 19:42:37,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:37,504 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:42:37,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:42:37,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:37,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:37,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1202718036, now seen corresponding path program 1 times [2025-03-16 19:42:37,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:37,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554760319] [2025-03-16 19:42:37,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:37,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:37,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-16 19:42:37,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-16 19:42:37,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:37,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:38,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4513 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-16 19:42:38,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:38,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554760319] [2025-03-16 19:42:38,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554760319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:38,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:38,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:42:38,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944301111] [2025-03-16 19:42:38,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:38,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:42:38,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:38,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:42:38,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:38,006 INFO L87 Difference]: Start difference. First operand 179 states and 271 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-16 19:42:38,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:38,056 INFO L93 Difference]: Finished difference Result 357 states and 542 transitions. [2025-03-16 19:42:38,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:42:38,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 300 [2025-03-16 19:42:38,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:38,060 INFO L225 Difference]: With dead ends: 357 [2025-03-16 19:42:38,062 INFO L226 Difference]: Without dead ends: 180 [2025-03-16 19:42:38,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:38,063 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:38,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:38,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-16 19:42:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-16 19:42:38,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 108 states have internal predecessors, (138), 67 states have call successors, (67), 4 states have call predecessors, (67), 4 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-16 19:42:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 272 transitions. [2025-03-16 19:42:38,089 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 272 transitions. Word has length 300 [2025-03-16 19:42:38,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:38,089 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 272 transitions. [2025-03-16 19:42:38,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-16 19:42:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 272 transitions. [2025-03-16 19:42:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-16 19:42:38,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:38,094 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:42:38,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:42:38,094 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:38,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:38,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1409021985, now seen corresponding path program 1 times [2025-03-16 19:42:38,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:38,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453991807] [2025-03-16 19:42:38,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:38,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:38,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-16 19:42:38,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-16 19:42:38,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:38,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:38,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-16 19:42:38,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:38,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453991807] [2025-03-16 19:42:38,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453991807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:42:38,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626977434] [2025-03-16 19:42:38,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:38,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:38,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:38,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:42:38,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:42:39,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-16 19:42:39,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-16 19:42:39,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:39,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:39,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:42:39,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:42:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-16 19:42:39,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:42:39,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-16 19:42:39,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626977434] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:42:39,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:42:39,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 19:42:39,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026161445] [2025-03-16 19:42:39,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:42:39,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:42:39,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:39,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:42:39,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:42:39,644 INFO L87 Difference]: Start difference. First operand 180 states and 272 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-16 19:42:39,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:39,700 INFO L93 Difference]: Finished difference Result 360 states and 546 transitions. [2025-03-16 19:42:39,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:42:39,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 301 [2025-03-16 19:42:39,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:39,702 INFO L225 Difference]: With dead ends: 360 [2025-03-16 19:42:39,702 INFO L226 Difference]: Without dead ends: 182 [2025-03-16 19:42:39,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 599 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:42:39,704 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:39,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 801 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:39,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-16 19:42:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-03-16 19:42:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 110 states have (on average 1.2727272727272727) internal successors, (140), 110 states have internal predecessors, (140), 67 states have call successors, (67), 4 states have call predecessors, (67), 4 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-16 19:42:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 274 transitions. [2025-03-16 19:42:39,716 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 274 transitions. Word has length 301 [2025-03-16 19:42:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:39,716 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 274 transitions. [2025-03-16 19:42:39,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-16 19:42:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 274 transitions. [2025-03-16 19:42:39,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-16 19:42:39,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:39,719 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:42:39,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 19:42:39,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:39,920 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:39,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:39,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1905123967, now seen corresponding path program 2 times [2025-03-16 19:42:39,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:39,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925267827] [2025-03-16 19:42:39,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:42:39,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:40,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 303 statements into 2 equivalence classes. [2025-03-16 19:42:40,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 303 statements. [2025-03-16 19:42:40,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:42:40,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4519 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4519 trivial. 0 not checked. [2025-03-16 19:42:40,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:40,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925267827] [2025-03-16 19:42:40,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925267827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:40,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:40,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:42:40,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421903268] [2025-03-16 19:42:40,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:40,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:42:40,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:40,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:42:40,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:42:40,399 INFO L87 Difference]: Start difference. First operand 182 states and 274 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-16 19:42:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:40,452 INFO L93 Difference]: Finished difference Result 355 states and 538 transitions. [2025-03-16 19:42:40,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:42:40,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 303 [2025-03-16 19:42:40,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:40,457 INFO L225 Difference]: With dead ends: 355 [2025-03-16 19:42:40,458 INFO L226 Difference]: Without dead ends: 253 [2025-03-16 19:42:40,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:42:40,459 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 161 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:40,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 797 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:40,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-16 19:42:40,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2025-03-16 19:42:40,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 158 states have (on average 1.3481012658227849) internal successors, (213), 158 states have internal predecessors, (213), 85 states have call successors, (85), 8 states have call predecessors, (85), 8 states have return successors, (87), 85 states have call predecessors, (87), 85 states have call successors, (87) [2025-03-16 19:42:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 385 transitions. [2025-03-16 19:42:40,487 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 385 transitions. Word has length 303 [2025-03-16 19:42:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:40,488 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 385 transitions. [2025-03-16 19:42:40,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-16 19:42:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 385 transitions. [2025-03-16 19:42:40,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-16 19:42:40,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:40,493 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:42:40,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:42:40,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:40,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:40,494 INFO L85 PathProgramCache]: Analyzing trace with hash 927093464, now seen corresponding path program 1 times [2025-03-16 19:42:40,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:40,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774576708] [2025-03-16 19:42:40,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:40,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:40,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-16 19:42:40,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-16 19:42:40,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:40,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5345 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5344 trivial. 0 not checked. [2025-03-16 19:42:41,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:41,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774576708] [2025-03-16 19:42:41,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774576708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:42:41,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742146563] [2025-03-16 19:42:41,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:41,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:41,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:41,014 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:42:41,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:42:41,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-16 19:42:41,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-16 19:42:41,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:41,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:41,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 2130 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:42:41,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:42:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5345 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5344 trivial. 0 not checked. [2025-03-16 19:42:41,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:42:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5345 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5344 trivial. 0 not checked. [2025-03-16 19:42:42,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742146563] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:42:42,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:42:42,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-16 19:42:42,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578354949] [2025-03-16 19:42:42,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:42:42,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:42:42,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:42,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:42:42,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:42:42,167 INFO L87 Difference]: Start difference. First operand 252 states and 385 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-03-16 19:42:46,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:42:50,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:42:54,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:42:58,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:02,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:02,327 INFO L93 Difference]: Finished difference Result 512 states and 782 transitions. [2025-03-16 19:43:02,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:02,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) Word has length 371 [2025-03-16 19:43:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:02,330 INFO L225 Difference]: With dead ends: 512 [2025-03-16 19:43:02,330 INFO L226 Difference]: Without dead ends: 267 [2025-03-16 19:43:02,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 739 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:02,332 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 4 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:02,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1062 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2025-03-16 19:43:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-16 19:43:02,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-03-16 19:43:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 173 states have (on average 1.3352601156069364) internal successors, (231), 173 states have internal predecessors, (231), 85 states have call successors, (85), 8 states have call predecessors, (85), 8 states have return successors, (87), 85 states have call predecessors, (87), 85 states have call successors, (87) [2025-03-16 19:43:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 403 transitions. [2025-03-16 19:43:02,363 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 403 transitions. Word has length 371 [2025-03-16 19:43:02,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:02,364 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 403 transitions. [2025-03-16 19:43:02,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-03-16 19:43:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 403 transitions. [2025-03-16 19:43:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-16 19:43:02,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:02,372 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 12, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 19:43:02,576 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:02,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:02,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:02,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1906867263, now seen corresponding path program 2 times [2025-03-16 19:43:02,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:02,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607047505] [2025-03-16 19:43:02,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:43:02,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:02,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 386 statements into 2 equivalence classes. [2025-03-16 19:43:02,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 386 statements. [2025-03-16 19:43:02,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:43:02,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5468 trivial. 0 not checked. [2025-03-16 19:43:03,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:03,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607047505] [2025-03-16 19:43:03,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607047505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:03,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:03,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:43:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127969150] [2025-03-16 19:43:03,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:03,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:03,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:03,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:03,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:03,205 INFO L87 Difference]: Start difference. First operand 267 states and 403 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) [2025-03-16 19:43:07,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:11,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:15,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:15,505 INFO L93 Difference]: Finished difference Result 628 states and 953 transitions. [2025-03-16 19:43:15,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:15,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) Word has length 386 [2025-03-16 19:43:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:15,511 INFO L225 Difference]: With dead ends: 628 [2025-03-16 19:43:15,512 INFO L226 Difference]: Without dead ends: 517 [2025-03-16 19:43:15,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:15,514 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 261 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:15,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1519 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 12.2s Time] [2025-03-16 19:43:15,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-16 19:43:15,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 510. [2025-03-16 19:43:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 322 states have (on average 1.3354037267080745) internal successors, (430), 325 states have internal predecessors, (430), 168 states have call successors, (168), 16 states have call predecessors, (168), 19 states have return successors, (183), 168 states have call predecessors, (183), 168 states have call successors, (183) [2025-03-16 19:43:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 781 transitions. [2025-03-16 19:43:15,562 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 781 transitions. Word has length 386 [2025-03-16 19:43:15,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:15,562 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 781 transitions. [2025-03-16 19:43:15,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) [2025-03-16 19:43:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 781 transitions. [2025-03-16 19:43:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-16 19:43:15,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:15,567 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 12, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:43:15,568 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:15,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:15,568 INFO L85 PathProgramCache]: Analyzing trace with hash -88313662, now seen corresponding path program 1 times [2025-03-16 19:43:15,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:15,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515720066] [2025-03-16 19:43:15,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:15,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:15,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-16 19:43:15,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-16 19:43:15,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:15,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5468 trivial. 0 not checked. [2025-03-16 19:43:16,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:16,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515720066] [2025-03-16 19:43:16,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515720066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:16,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:16,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:43:16,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597403115] [2025-03-16 19:43:16,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:16,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:16,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:16,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:16,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:16,566 INFO L87 Difference]: Start difference. First operand 510 states and 781 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) [2025-03-16 19:43:20,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:24,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:28,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:28,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:28,878 INFO L93 Difference]: Finished difference Result 923 states and 1400 transitions. [2025-03-16 19:43:28,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:28,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) Word has length 386 [2025-03-16 19:43:28,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:28,882 INFO L225 Difference]: With dead ends: 923 [2025-03-16 19:43:28,882 INFO L226 Difference]: Without dead ends: 458 [2025-03-16 19:43:28,883 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:28,884 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 263 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:28,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1533 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 12.3s Time] [2025-03-16 19:43:28,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-16 19:43:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 454. [2025-03-16 19:43:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 285 states have (on average 1.2701754385964912) internal successors, (362), 287 states have internal predecessors, (362), 151 states have call successors, (151), 15 states have call predecessors, (151), 17 states have return successors, (159), 151 states have call predecessors, (159), 151 states have call successors, (159) [2025-03-16 19:43:28,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 672 transitions. [2025-03-16 19:43:28,912 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 672 transitions. Word has length 386 [2025-03-16 19:43:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:28,912 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 672 transitions. [2025-03-16 19:43:28,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) [2025-03-16 19:43:28,913 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 672 transitions. [2025-03-16 19:43:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-16 19:43:28,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:28,916 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 12, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:43:28,916 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:28,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:28,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2004694562, now seen corresponding path program 1 times [2025-03-16 19:43:28,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:28,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743795447] [2025-03-16 19:43:28,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:28,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:29,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-16 19:43:29,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-16 19:43:29,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:29,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 5362 trivial. 0 not checked. [2025-03-16 19:43:29,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:29,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743795447] [2025-03-16 19:43:29,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743795447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:29,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68564702] [2025-03-16 19:43:29,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:29,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:29,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:29,556 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:43:29,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:43:30,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-16 19:43:30,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-16 19:43:30,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:30,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:30,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 2486 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:43:30,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 5362 trivial. 0 not checked. [2025-03-16 19:43:30,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:43:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 5362 trivial. 0 not checked. [2025-03-16 19:43:30,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68564702] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:43:30,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:43:30,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 10 [2025-03-16 19:43:30,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230589211] [2025-03-16 19:43:30,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:43:30,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:43:30,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:30,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:43:30,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:43:30,846 INFO L87 Difference]: Start difference. First operand 454 states and 672 transitions. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-03-16 19:43:34,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:38,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:42,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:46,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:51,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:55,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:59,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:03,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:03,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:44:03,151 INFO L93 Difference]: Finished difference Result 901 states and 1338 transitions. [2025-03-16 19:44:03,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:44:03,152 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) Word has length 386 [2025-03-16 19:44:03,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:44:03,155 INFO L225 Difference]: With dead ends: 901 [2025-03-16 19:44:03,155 INFO L226 Difference]: Without dead ends: 469 [2025-03-16 19:44:03,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 766 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:44:03,159 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 2 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:44:03,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 530 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 8 Unknown, 0 Unchecked, 32.3s Time] [2025-03-16 19:44:03,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-16 19:44:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2025-03-16 19:44:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 300 states have (on average 1.2666666666666666) internal successors, (380), 302 states have internal predecessors, (380), 151 states have call successors, (151), 15 states have call predecessors, (151), 17 states have return successors, (159), 151 states have call predecessors, (159), 151 states have call successors, (159) [2025-03-16 19:44:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 690 transitions. [2025-03-16 19:44:03,196 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 690 transitions. Word has length 386 [2025-03-16 19:44:03,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:44:03,197 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 690 transitions. [2025-03-16 19:44:03,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-03-16 19:44:03,197 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 690 transitions. [2025-03-16 19:44:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-16 19:44:03,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:44:03,201 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 21, 7, 7, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 19:44:03,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:44:03,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:44:03,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:44:03,403 INFO L85 PathProgramCache]: Analyzing trace with hash 455407129, now seen corresponding path program 2 times [2025-03-16 19:44:03,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:44:03,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390156784] [2025-03-16 19:44:03,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:44:03,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:44:03,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 401 statements into 2 equivalence classes. [2025-03-16 19:44:03,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 401 of 401 statements. [2025-03-16 19:44:03,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 19:44:03,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:44:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5744 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5740 trivial. 0 not checked. [2025-03-16 19:44:04,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:44:04,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390156784] [2025-03-16 19:44:04,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390156784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:44:04,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124344909] [2025-03-16 19:44:04,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:44:04,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:44:04,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:44:04,293 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:04,294 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:04,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 401 statements into 2 equivalence classes.