./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_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-?-798a7b3-m [2025-03-03 15:23:19,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:23:19,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:23:19,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:23:19,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:23:19,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:23:19,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:23:19,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:23:19,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:23:19,083 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:23:19,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:23:19,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:23:19,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:23:19,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:23:19,085 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:23:19,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:23:19,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:23:19,085 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:23:19,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:23:19,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:23:19,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:23:19,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:23:19,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:23:19,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:23:19,086 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:23:19,086 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:23:19,086 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:23:19,086 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:23:19,086 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:23:19,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:23:19,087 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:23:19,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:23:19,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:23:19,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:23:19,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:23:19,087 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:23:19,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:23:19,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:23:19,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:23:19,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:23:19,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:23:19,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:23:19,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:23:19,088 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-03 15:23:19,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:23:19,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:23:19,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:23:19,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:23:19,346 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:23:19,348 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-03 15:23:20,511 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d84fe234d/1d73d9a0d09049bbb921c21233efc84d/FLAG68270aa8d [2025-03-03 15:23:20,839 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:23:20,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_fib_longer-1.i [2025-03-03 15:23:20,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d84fe234d/1d73d9a0d09049bbb921c21233efc84d/FLAG68270aa8d [2025-03-03 15:23:21,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d84fe234d/1d73d9a0d09049bbb921c21233efc84d [2025-03-03 15:23:21,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:23:21,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:23:21,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:23:21,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:23:21,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:23:21,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:23:21" (1/1) ... [2025-03-03 15:23:21,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1298cda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:21, skipping insertion in model container [2025-03-03 15:23:21,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:23:21" (1/1) ... [2025-03-03 15:23:21,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:23:21,334 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-03 15:23:21,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:23:21,477 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:23:21,499 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-03 15:23:21,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:23:21,589 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:23:21,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:21 WrapperNode [2025-03-03 15:23:21,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:23:21,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:23:21,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:23:21,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:23:21,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:21" (1/1) ... [2025-03-03 15:23:21,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:21" (1/1) ... [2025-03-03 15:23:21,664 INFO L138 Inliner]: procedures = 145, calls = 446, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 777 [2025-03-03 15:23:21,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:23:21,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:23:21,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:23:21,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:23:21,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:21" (1/1) ... [2025-03-03 15:23:21,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:21" (1/1) ... [2025-03-03 15:23:21,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:21" (1/1) ... [2025-03-03 15:23:21,729 INFO L175 MemorySlicer]: Split 310 memory accesses to 15 slices as follows [2, 8, 8, 8, 62, 13, 57, 13, 25, 25, 11, 0, 37, 4, 37]. 20 percent of accesses are in the largest equivalence class. The 76 initializations are split as follows [2, 3, 3, 3, 21, 0, 21, 0, 7, 7, 7, 0, 0, 2, 0]. The 71 writes are split as follows [0, 2, 2, 2, 23, 1, 18, 1, 8, 8, 2, 0, 1, 2, 1]. [2025-03-03 15:23:21,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:21" (1/1) ... [2025-03-03 15:23:21,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:21" (1/1) ... [2025-03-03 15:23:21,763 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:21" (1/1) ... [2025-03-03 15:23:21,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:21" (1/1) ... [2025-03-03 15:23:21,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:21" (1/1) ... [2025-03-03 15:23:21,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:21" (1/1) ... [2025-03-03 15:23:21,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:23:21,799 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:23:21,799 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:23:21,799 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:23:21,800 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:21" (1/1) ... [2025-03-03 15:23:21,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:23:21,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:23:21,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:23:21,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:23:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 15:23:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 15:23:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 15:23:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 15:23:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 15:23:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 15:23:21,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 15:23:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 15:23:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-03 15:23:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-03 15:23:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-03 15:23:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-03 15:23:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-03 15:23:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-03 15:23:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-03 15:23:21,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 15:23:21,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 15:23:21,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 15:23:21,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 15:23:21,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 15:23:21,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 15:23:21,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 15:23:21,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 15:23:21,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-03 15:23:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-03 15:23:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-03 15:23:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-03 15:23:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-03 15:23:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-03 15:23:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-03 15:23:21,849 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 15:23:21,849 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 15:23:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:23:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 15:23:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 15:23:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 15:23:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 15:23:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-03 15:23:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-03 15:23:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-03 15:23:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-03 15:23:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-03 15:23:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-03 15:23:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-03 15:23:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-03 15:23:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-03 15:23:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-03 15:23:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-03 15:23:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-03 15:23:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-03 15:23:21,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-03 15:23:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 15:23:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 15:23:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 15:23:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-03 15:23:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-03 15:23:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:23:21,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-03 15:23:21,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 15:23:21,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 15:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 15:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 15:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 15:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 15:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 15:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 15:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 15:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 15:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 15:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 15:23:21,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:23:21,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:23:22,068 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:23:22,070 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:23:22,323 INFO L1325 $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-03 15:23:22,324 INFO L1325 $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-03 15:23:22,324 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:22,324 INFO L1325 $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-03 15:23:22,324 INFO L1325 $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-03 15:23:22,324 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:22,325 INFO L1325 $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-03 15:23:22,325 INFO L1325 $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-03 15:23:22,325 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:23:26,759 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-03 15:23:26,759 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:23:26,772 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:23:26,773 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:23:26,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:23:26 BoogieIcfgContainer [2025-03-03 15:23:26,774 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:23:26,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:23:26,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:23:26,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:23:26,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:23:21" (1/3) ... [2025-03-03 15:23:26,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed5b0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:23:26, skipping insertion in model container [2025-03-03 15:23:26,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:23:21" (2/3) ... [2025-03-03 15:23:26,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed5b0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:23:26, skipping insertion in model container [2025-03-03 15:23:26,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:23:26" (3/3) ... [2025-03-03 15:23:26,782 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_fib_longer-1.i [2025-03-03 15:23:26,792 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:23:26,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_fib_longer-1.i that has 5 procedures, 183 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-03 15:23:26,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:23:26,852 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;@5d3f5d6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:23:26,853 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:23:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 110 states have (on average 1.3) internal successors, (143), 111 states have internal predecessors, (143), 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-03 15:23:26,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-03 15:23:26,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:26,872 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] [2025-03-03 15:23:26,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:26,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:26,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1357281778, now seen corresponding path program 1 times [2025-03-03 15:23:26,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:26,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300600746] [2025-03-03 15:23:26,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:26,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:27,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-03 15:23:27,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-03 15:23:27,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:27,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:27,864 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-03 15:23:27,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:27,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300600746] [2025-03-03 15:23:27,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300600746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:23:27,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:23:27,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:23:27,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255522119] [2025-03-03 15:23:27,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:23:27,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:23:27,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:27,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:23:27,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:23:27,890 INFO L87 Difference]: Start difference. First operand has 183 states, 110 states have (on average 1.3) internal successors, (143), 111 states have internal predecessors, (143), 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.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03 15:23:31,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:23:32,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:32,028 INFO L93 Difference]: Finished difference Result 364 states and 617 transitions. [2025-03-03 15:23:32,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:23:32,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 299 [2025-03-03 15:23:32,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:32,037 INFO L225 Difference]: With dead ends: 364 [2025-03-03 15:23:32,037 INFO L226 Difference]: Without dead ends: 181 [2025-03-03 15:23:32,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:23:32,044 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 2 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 541 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-03 15:23:32,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 541 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-03 15:23:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-03 15:23:32,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2025-03-03 15:23:32,092 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-03 15:23:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 272 transitions. [2025-03-03 15:23:32,101 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 272 transitions. Word has length 299 [2025-03-03 15:23:32,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:32,102 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 272 transitions. [2025-03-03 15:23:32,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03 15:23:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 272 transitions. [2025-03-03 15:23:32,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-03 15:23:32,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:32,109 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-03 15:23:32,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:23:32,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:32,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:32,111 INFO L85 PathProgramCache]: Analyzing trace with hash 869342340, now seen corresponding path program 1 times [2025-03-03 15:23:32,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:32,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171578726] [2025-03-03 15:23:32,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:32,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:32,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-03 15:23:32,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-03 15:23:32,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:32,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:32,600 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-03 15:23:32,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:32,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171578726] [2025-03-03 15:23:32,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171578726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:23:32,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:23:32,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:23:32,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047812191] [2025-03-03 15:23:32,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:23:32,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:23:32,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:32,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:23:32,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:23:32,604 INFO L87 Difference]: Start difference. First operand 180 states and 272 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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-03 15:23:32,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:32,650 INFO L93 Difference]: Finished difference Result 358 states and 543 transitions. [2025-03-03 15:23:32,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:23:32,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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 301 [2025-03-03 15:23:32,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:32,655 INFO L225 Difference]: With dead ends: 358 [2025-03-03 15:23:32,655 INFO L226 Difference]: Without dead ends: 181 [2025-03-03 15:23:32,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:23:32,659 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:32,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 537 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:23:32,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-03 15:23:32,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-03 15:23:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 109 states have (on average 1.275229357798165) internal successors, (139), 109 states have internal predecessors, (139), 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-03 15:23:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 273 transitions. [2025-03-03 15:23:32,682 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 273 transitions. Word has length 301 [2025-03-03 15:23:32,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:32,682 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 273 transitions. [2025-03-03 15:23:32,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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-03 15:23:32,682 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 273 transitions. [2025-03-03 15:23:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-03 15:23:32,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:32,688 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, 1] [2025-03-03 15:23:32,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:23:32,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:32,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:32,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1488025653, now seen corresponding path program 1 times [2025-03-03 15:23:32,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:32,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246141408] [2025-03-03 15:23:32,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:32,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:32,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-03 15:23:32,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-03 15:23:32,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:32,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:33,246 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-03 15:23:33,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:33,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246141408] [2025-03-03 15:23:33,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246141408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:23:33,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252195064] [2025-03-03 15:23:33,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:33,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:23:33,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:23:33,250 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:23:33,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:23:33,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-03 15:23:33,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-03 15:23:33,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:33,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:33,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:23:33,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:23:33,951 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-03 15:23:33,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:23:34,398 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-03 15:23:34,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252195064] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:23:34,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:23:34,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 15:23:34,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346364991] [2025-03-03 15:23:34,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:23:34,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:23:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:34,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:23:34,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:23:34,401 INFO L87 Difference]: Start difference. First operand 181 states and 273 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-03 15:23:34,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:34,447 INFO L93 Difference]: Finished difference Result 361 states and 547 transitions. [2025-03-03 15:23:34,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:23:34,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 302 [2025-03-03 15:23:34,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:34,451 INFO L225 Difference]: With dead ends: 361 [2025-03-03 15:23:34,453 INFO L226 Difference]: Without dead ends: 183 [2025-03-03 15:23:34,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 601 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:23:34,455 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:34,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 804 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:23:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-03 15:23:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-03-03 15:23:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 111 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-03 15:23:34,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 275 transitions. [2025-03-03 15:23:34,475 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 275 transitions. Word has length 302 [2025-03-03 15:23:34,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:34,475 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 275 transitions. [2025-03-03 15:23:34,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-03 15:23:34,475 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 275 transitions. [2025-03-03 15:23:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-03 15:23:34,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:34,478 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, 1] [2025-03-03 15:23:34,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:23:34,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:23:34,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:34,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash 760101611, now seen corresponding path program 2 times [2025-03-03 15:23:34,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:34,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379288013] [2025-03-03 15:23:34,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:23:34,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:34,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 304 statements into 2 equivalence classes. [2025-03-03 15:23:34,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 304 statements. [2025-03-03 15:23:34,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:23:34,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:35,162 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-03 15:23:35,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:35,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379288013] [2025-03-03 15:23:35,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379288013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:23:35,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:23:35,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:23:35,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670533706] [2025-03-03 15:23:35,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:23:35,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:23:35,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:35,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:23:35,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:23:35,166 INFO L87 Difference]: Start difference. First operand 183 states and 275 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-03 15:23:35,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:35,217 INFO L93 Difference]: Finished difference Result 356 states and 539 transitions. [2025-03-03 15:23:35,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:23:35,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 304 [2025-03-03 15:23:35,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:35,224 INFO L225 Difference]: With dead ends: 356 [2025-03-03 15:23:35,224 INFO L226 Difference]: Without dead ends: 254 [2025-03-03 15:23:35,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:23:35,226 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 161 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 799 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-03 15:23:35,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 799 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:23:35,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-03 15:23:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2025-03-03 15:23:35,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 159 states have (on average 1.3459119496855345) internal successors, (214), 159 states have internal predecessors, (214), 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-03 15:23:35,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 386 transitions. [2025-03-03 15:23:35,261 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 386 transitions. Word has length 304 [2025-03-03 15:23:35,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:35,261 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 386 transitions. [2025-03-03 15:23:35,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-03 15:23:35,262 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 386 transitions. [2025-03-03 15:23:35,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-03 15:23:35,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:35,267 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, 1] [2025-03-03 15:23:35,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:23:35,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:35,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:35,268 INFO L85 PathProgramCache]: Analyzing trace with hash -380446461, now seen corresponding path program 1 times [2025-03-03 15:23:35,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:35,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132877298] [2025-03-03 15:23:35,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:35,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:35,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 15:23:35,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 15:23:35,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:35,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:35,773 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-03 15:23:35,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:35,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132877298] [2025-03-03 15:23:35,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132877298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:23:35,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895926947] [2025-03-03 15:23:35,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:23:35,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:23:35,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:23:35,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:23:35,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:23:36,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 15:23:36,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 15:23:36,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:23:36,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:36,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 2141 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:23:36,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:23:36,498 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-03 15:23:36,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:23:36,971 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-03 15:23:36,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895926947] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:23:36,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:23:36,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 15:23:36,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344695903] [2025-03-03 15:23:36,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:23:36,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:23:36,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:36,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:23:36,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:23:36,975 INFO L87 Difference]: Start difference. First operand 253 states and 386 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-03 15:23:41,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:23:45,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:23:49,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:23:53,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:23:57,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:23:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:23:57,195 INFO L93 Difference]: Finished difference Result 513 states and 783 transitions. [2025-03-03 15:23:57,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:23:57,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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 372 [2025-03-03 15:23:57,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:23:57,198 INFO L225 Difference]: With dead ends: 513 [2025-03-03 15:23:57,199 INFO L226 Difference]: Without dead ends: 268 [2025-03-03 15:23:57,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 741 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-03 15:23:57,200 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 4 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:23:57,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1066 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2025-03-03 15:23:57,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-03 15:23:57,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-03-03 15:23:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 174 states have (on average 1.3333333333333333) internal successors, (232), 174 states have internal predecessors, (232), 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-03 15:23:57,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 404 transitions. [2025-03-03 15:23:57,220 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 404 transitions. Word has length 372 [2025-03-03 15:23:57,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:23:57,220 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 404 transitions. [2025-03-03 15:23:57,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-03 15:23:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 404 transitions. [2025-03-03 15:23:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-03 15:23:57,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:23:57,225 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, 1] [2025-03-03 15:23:57,236 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-03 15:23:57,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:23:57,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:23:57,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:23:57,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2113397658, now seen corresponding path program 2 times [2025-03-03 15:23:57,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:23:57,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120367547] [2025-03-03 15:23:57,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:23:57,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:23:57,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 387 statements into 2 equivalence classes. [2025-03-03 15:23:57,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 387 statements. [2025-03-03 15:23:57,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:23:57,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:23:57,951 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-03 15:23:57,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:23:57,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120367547] [2025-03-03 15:23:57,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120367547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:23:57,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:23:57,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:23:57,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885892077] [2025-03-03 15:23:57,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:23:57,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:23:57,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:23:57,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:23:57,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:23:57,953 INFO L87 Difference]: Start difference. First operand 268 states and 404 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-03 15:24:01,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:05,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:06,096 INFO L93 Difference]: Finished difference Result 732 states and 1120 transitions. [2025-03-03 15:24:06,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:24:06,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 387 [2025-03-03 15:24:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:06,099 INFO L225 Difference]: With dead ends: 732 [2025-03-03 15:24:06,099 INFO L226 Difference]: Without dead ends: 503 [2025-03-03 15:24:06,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:06,101 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 255 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:06,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1128 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-03-03 15:24:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-03 15:24:06,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 499. [2025-03-03 15:24:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 315 states have (on average 1.3365079365079364) internal successors, (421), 315 states have internal predecessors, (421), 167 states have call successors, (167), 16 states have call predecessors, (167), 16 states have return successors, (178), 167 states have call predecessors, (178), 167 states have call successors, (178) [2025-03-03 15:24:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 766 transitions. [2025-03-03 15:24:06,139 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 766 transitions. Word has length 387 [2025-03-03 15:24:06,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:06,140 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 766 transitions. [2025-03-03 15:24:06,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-03 15:24:06,140 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 766 transitions. [2025-03-03 15:24:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-03 15:24:06,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:06,145 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, 1] [2025-03-03 15:24:06,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:24:06,145 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:06,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:06,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1324957946, now seen corresponding path program 1 times [2025-03-03 15:24:06,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:06,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884031418] [2025-03-03 15:24:06,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:06,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:06,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-03 15:24:06,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-03 15:24:06,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:06,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:07,238 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-03 15:24:07,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:07,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884031418] [2025-03-03 15:24:07,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884031418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:07,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:07,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:24:07,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290096240] [2025-03-03 15:24:07,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:07,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:24:07,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:07,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:24:07,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:07,241 INFO L87 Difference]: Start difference. First operand 499 states and 766 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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-03 15:24:11,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:15,301 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-03 15:24:19,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:19,548 INFO L93 Difference]: Finished difference Result 852 states and 1288 transitions. [2025-03-03 15:24:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:24:19,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 387 [2025-03-03 15:24:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:19,554 INFO L225 Difference]: With dead ends: 852 [2025-03-03 15:24:19,554 INFO L226 Difference]: Without dead ends: 456 [2025-03-03 15:24:19,555 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-03 15:24:19,556 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 259 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:19,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1515 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 12.3s Time] [2025-03-03 15:24:19,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-03 15:24:19,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 452. [2025-03-03 15:24:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 284 states have (on average 1.2640845070422535) internal successors, (359), 286 states have internal predecessors, (359), 150 states have call successors, (150), 15 states have call predecessors, (150), 17 states have return successors, (158), 150 states have call predecessors, (158), 150 states have call successors, (158) [2025-03-03 15:24:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 667 transitions. [2025-03-03 15:24:19,595 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 667 transitions. Word has length 387 [2025-03-03 15:24:19,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:19,596 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 667 transitions. [2025-03-03 15:24:19,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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-03 15:24:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 667 transitions. [2025-03-03 15:24:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-03 15:24:19,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:19,600 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, 1] [2025-03-03 15:24:19,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:24:19,600 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:19,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:19,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2109681465, now seen corresponding path program 1 times [2025-03-03 15:24:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:19,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205439372] [2025-03-03 15:24:19,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:19,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:19,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-03 15:24:19,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-03 15:24:19,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:19,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:20,319 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-03 15:24:20,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:20,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205439372] [2025-03-03 15:24:20,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205439372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:20,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828322825] [2025-03-03 15:24:20,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:20,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:20,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:20,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:24:20,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:24:20,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-03 15:24:21,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-03 15:24:21,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:21,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:21,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 2475 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:24:21,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:21,154 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-03 15:24:21,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:24:21,637 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-03 15:24:21,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828322825] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:24:21,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:24:21,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-03 15:24:21,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90927734] [2025-03-03 15:24:21,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:24:21,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:24:21,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:21,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:24:21,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:24:21,640 INFO L87 Difference]: Start difference. First operand 452 states and 667 transitions. Second operand has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 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-03 15:24:25,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:29,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:33,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:37,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:41,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:45,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:49,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:53,895 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-03 15:24:53,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:53,949 INFO L93 Difference]: Finished difference Result 896 states and 1327 transitions. [2025-03-03 15:24:53,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:24:53,951 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 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 387 [2025-03-03 15:24:53,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:53,954 INFO L225 Difference]: With dead ends: 896 [2025-03-03 15:24:53,954 INFO L226 Difference]: Without dead ends: 467 [2025-03-03 15:24:53,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 768 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-03 15:24:53,959 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 2 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 797 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-03 15:24:53,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 797 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 8 Unknown, 0 Unchecked, 32.3s Time] [2025-03-03 15:24:53,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-03 15:24:53,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2025-03-03 15:24:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 299 states have (on average 1.2608695652173914) internal successors, (377), 301 states have internal predecessors, (377), 150 states have call successors, (150), 15 states have call predecessors, (150), 17 states have return successors, (158), 150 states have call predecessors, (158), 150 states have call successors, (158) [2025-03-03 15:24:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 685 transitions. [2025-03-03 15:24:53,994 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 685 transitions. Word has length 387 [2025-03-03 15:24:53,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:53,994 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 685 transitions. [2025-03-03 15:24:53,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 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-03 15:24:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 685 transitions. [2025-03-03 15:24:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-03 15:24:53,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:53,998 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, 1] [2025-03-03 15:24:54,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 15:24:54,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:54,202 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:54,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:54,203 INFO L85 PathProgramCache]: Analyzing trace with hash 707707842, now seen corresponding path program 2 times [2025-03-03 15:24:54,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:54,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901984285] [2025-03-03 15:24:54,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:24:54,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:54,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 402 statements into 2 equivalence classes. [2025-03-03 15:24:54,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 402 of 402 statements. [2025-03-03 15:24:54,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 15:24:54,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:55,397 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-03 15:24:55,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901984285] [2025-03-03 15:24:55,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901984285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028549095] [2025-03-03 15:24:55,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:24:55,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:55,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:55,400 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:24:55,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:24:56,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 402 statements into 2 equivalence classes.