./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/memory-model/4SB.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/memory-model/4SB.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 15b0cbd6c91287c392a1dcce1e0a32a1c72d5f0acdee848dea776c36b74cf850 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:46:21,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:46:21,351 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:46:21,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:46:21,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:46:21,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:46:21,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:46:21,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:46:21,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:46:21,369 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:46:21,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:46:21,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:46:21,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:46:21,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:46:21,370 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:46:21,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:46:21,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:46:21,370 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:46:21,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:46:21,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:46:21,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:46:21,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:46:21,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:46:21,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:46:21,371 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:46:21,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:46:21,371 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:46:21,371 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:46:21,371 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:46:21,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:46:21,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:46:21,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:46:21,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:46:21,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:46:21,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:46:21,372 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:46:21,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:46:21,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:46:21,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:46:21,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:46:21,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:46:21,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:46:21,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:46:21,372 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 -> 15b0cbd6c91287c392a1dcce1e0a32a1c72d5f0acdee848dea776c36b74cf850 [2025-03-03 09:46:21,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:46:21,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:46:21,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:46:21,610 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:46:21,610 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:46:21,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memory-model/4SB.i [2025-03-03 09:46:22,768 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75057e86c/3df6a3c3b5aa4db5afda177e4c7bca1b/FLAG037e7d495 [2025-03-03 09:46:23,083 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:46:23,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memory-model/4SB.i [2025-03-03 09:46:23,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75057e86c/3df6a3c3b5aa4db5afda177e4c7bca1b/FLAG037e7d495 [2025-03-03 09:46:23,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75057e86c/3df6a3c3b5aa4db5afda177e4c7bca1b [2025-03-03 09:46:23,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:46:23,114 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:46:23,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:46:23,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:46:23,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:46:23,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:46:23" (1/1) ... [2025-03-03 09:46:23,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b432a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:46:23, skipping insertion in model container [2025-03-03 09:46:23,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:46:23" (1/1) ... [2025-03-03 09:46:23,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:46:23,401 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/memory-model/4SB.i[21105,21118] [2025-03-03 09:46:23,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:46:23,414 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:46:23,494 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/memory-model/4SB.i[21105,21118] [2025-03-03 09:46:23,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:46:23,508 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:46:23,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:46:23 WrapperNode [2025-03-03 09:46:23,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:46:23,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:46:23,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:46:23,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:46:23,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:46:23" (1/1) ... [2025-03-03 09:46:23,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:46:23" (1/1) ... [2025-03-03 09:46:23,586 INFO L138 Inliner]: procedures = 27, calls = 680, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 1617 [2025-03-03 09:46:23,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:46:23,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:46:23,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:46:23,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:46:23,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:46:23" (1/1) ... [2025-03-03 09:46:23,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:46:23" (1/1) ... [2025-03-03 09:46:23,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:46:23" (1/1) ... [2025-03-03 09:46:23,641 INFO L175 MemorySlicer]: Split 488 memory accesses to 16 slices as follows [12, 45, 15, 96, 13, 13, 13, 152, 10, 13, 3, 10, 60, 10, 12, 11]. 31 percent of accesses are in the largest equivalence class. The 36 initializations are split as follows [10, 0, 0, 0, 5, 5, 5, 0, 0, 5, 0, 0, 0, 1, 5, 0]. The 171 writes are split as follows [1, 15, 5, 20, 2, 2, 2, 80, 5, 2, 2, 5, 20, 3, 2, 5]. [2025-03-03 09:46:23,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:46:23" (1/1) ... [2025-03-03 09:46:23,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:46:23" (1/1) ... [2025-03-03 09:46:23,687 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:46:23" (1/1) ... [2025-03-03 09:46:23,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:46:23" (1/1) ... [2025-03-03 09:46:23,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:46:23" (1/1) ... [2025-03-03 09:46:23,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:46:23" (1/1) ... [2025-03-03 09:46:23,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:46:23,723 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:46:23,723 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:46:23,723 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:46:23,724 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:46:23" (1/1) ... [2025-03-03 09:46:23,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:46:23,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:23,749 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 09:46:23,754 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 09:46:23,769 INFO L130 BoogieDeclarations]: Found specification of procedure store_buffering_4_conditions [2025-03-03 09:46:23,769 INFO L138 BoogieDeclarations]: Found implementation of procedure store_buffering_4_conditions [2025-03-03 09:46:23,769 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_write [2025-03-03 09:46:23,769 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_write [2025-03-03 09:46:23,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_headerT [2025-03-03 09:46:23,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_nondet_headerT [2025-03-03 09:46:23,769 INFO L130 BoogieDeclarations]: Found specification of procedure stepWriteBuffer [2025-03-03 09:46:23,769 INFO L138 BoogieDeclarations]: Found implementation of procedure stepWriteBuffer [2025-03-03 09:46:23,769 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_read [2025-03-03 09:46:23,770 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_read [2025-03-03 09:46:23,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:46:23,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:46:23,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:46:23,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:46:23,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 09:46:23,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 09:46:23,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 09:46:23,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 09:46:23,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 09:46:23,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-03 09:46:23,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-03 09:46:23,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-03 09:46:23,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-03 09:46:23,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-03 09:46:23,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-03 09:46:23,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-03 09:46:23,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-03 09:46:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:46:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:46:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:46:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 09:46:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 09:46:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 09:46:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 09:46:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 09:46:23,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure initWriteBuffer [2025-03-03 09:46:23,774 INFO L138 BoogieDeclarations]: Found implementation of procedure initWriteBuffer [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_fence [2025-03-03 09:46:23,774 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_fence [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:46:23,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:46:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:46:23,979 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:46:23,980 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:46:25,029 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L62: havoc __VERIFIER_nondet_operations_#t~nondet1#1; [2025-03-03 09:46:25,030 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: havoc #t~mem7#1;havoc #t~mem8#1;havoc #t~mem9#1;havoc #t~mem10#1;havoc #t~mem11#1;call ULTIMATE.dealloc(~#result~0#1.base, ~#result~0#1.offset);havoc ~#result~0#1.base, ~#result~0#1.offset; [2025-03-03 09:46:25,576 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: havoc __VERIFIER_nondet_step_#t~nondet0#1; [2025-03-03 09:46:25,577 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: call ULTIMATE.dealloc(main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset);havoc main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset);havoc main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset);havoc main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer2~0#1.base, main_~#wrBuffer2~0#1.offset);havoc main_~#wrBuffer2~0#1.base, main_~#wrBuffer2~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer3~0#1.base, main_~#wrBuffer3~0#1.offset);havoc main_~#wrBuffer3~0#1.base, main_~#wrBuffer3~0#1.offset;call ULTIMATE.dealloc(main_~#g_history~0#1.base, main_~#g_history~0#1.offset);havoc main_~#g_history~0#1.base, main_~#g_history~0#1.offset;call ULTIMATE.dealloc(main_~#global_time~0#1.base, main_~#global_time~0#1.offset);havoc main_~#global_time~0#1.base, main_~#global_time~0#1.offset;call ULTIMATE.dealloc(main_~#litmus_input~0#1.base, main_~#litmus_input~0#1.offset);havoc main_~#litmus_input~0#1.base, main_~#litmus_input~0#1.offset;call ULTIMATE.dealloc(main_~#input_action~0#1.base, main_~#input_action~0#1.offset);havoc main_~#input_action~0#1.base, main_~#input_action~0#1.offset; [2025-03-03 09:46:25,636 INFO L? ?]: Removed 207 outVars from TransFormulas that were not future-live. [2025-03-03 09:46:25,637 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:46:25,651 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:46:25,651 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:46:25,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:46:25 BoogieIcfgContainer [2025-03-03 09:46:25,651 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:46:25,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:46:25,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:46:25,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:46:25,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:46:23" (1/3) ... [2025-03-03 09:46:25,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d07dd67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:46:25, skipping insertion in model container [2025-03-03 09:46:25,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:46:23" (2/3) ... [2025-03-03 09:46:25,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d07dd67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:46:25, skipping insertion in model container [2025-03-03 09:46:25,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:46:25" (3/3) ... [2025-03-03 09:46:25,657 INFO L128 eAbstractionObserver]: Analyzing ICFG 4SB.i [2025-03-03 09:46:25,667 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:46:25,668 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 4SB.i that has 8 procedures, 272 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-03-03 09:46:25,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:46:25,723 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;@130782c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:46:25,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:46:25,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 272 states, 237 states have (on average 1.5696202531645569) internal successors, (372), 242 states have internal predecessors, (372), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:25,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 09:46:25,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:25,739 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-03 09:46:25,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:25,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:25,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1745163428, now seen corresponding path program 1 times [2025-03-03 09:46:25,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:25,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845748320] [2025-03-03 09:46:25,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:25,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:26,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 09:46:26,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 09:46:26,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:26,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:46:26,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:26,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845748320] [2025-03-03 09:46:26,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845748320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:26,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:46:26,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:46:26,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612608169] [2025-03-03 09:46:26,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:26,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:26,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:26,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:26,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:46:26,394 INFO L87 Difference]: Start difference. First operand has 272 states, 237 states have (on average 1.5696202531645569) internal successors, (372), 242 states have internal predecessors, (372), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:26,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:26,452 INFO L93 Difference]: Finished difference Result 542 states and 846 transitions. [2025-03-03 09:46:26,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:26,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2025-03-03 09:46:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:26,462 INFO L225 Difference]: With dead ends: 542 [2025-03-03 09:46:26,462 INFO L226 Difference]: Without dead ends: 258 [2025-03-03 09:46:26,464 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 09:46:26,466 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 0 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 747 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 09:46:26,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 747 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-03 09:46:26,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-03-03 09:46:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 224 states have (on average 1.3258928571428572) internal successors, (297), 228 states have internal predecessors, (297), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 349 transitions. [2025-03-03 09:46:26,504 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 349 transitions. Word has length 64 [2025-03-03 09:46:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:26,505 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 349 transitions. [2025-03-03 09:46:26,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 349 transitions. [2025-03-03 09:46:26,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 09:46:26,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:26,508 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-03 09:46:26,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:46:26,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:26,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:26,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2006953936, now seen corresponding path program 1 times [2025-03-03 09:46:26,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:26,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946382118] [2025-03-03 09:46:26,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:26,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:26,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 09:46:26,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 09:46:26,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:26,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:46:26,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:26,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946382118] [2025-03-03 09:46:26,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946382118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:26,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658568225] [2025-03-03 09:46:26,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:26,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:26,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:26,877 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 09:46:26,879 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 09:46:27,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 09:46:27,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 09:46:27,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:27,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:27,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:46:27,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:46:27,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:27,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658568225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:27,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:27,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:27,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320821554] [2025-03-03 09:46:27,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:27,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:27,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:27,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:27,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:27,274 INFO L87 Difference]: Start difference. First operand 258 states and 349 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:27,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:27,300 INFO L93 Difference]: Finished difference Result 511 states and 696 transitions. [2025-03-03 09:46:27,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:27,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2025-03-03 09:46:27,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:27,302 INFO L225 Difference]: With dead ends: 511 [2025-03-03 09:46:27,303 INFO L226 Difference]: Without dead ends: 259 [2025-03-03 09:46:27,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:27,306 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:27,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 692 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:27,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-03 09:46:27,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-03-03 09:46:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 225 states have (on average 1.3244444444444445) internal successors, (298), 229 states have internal predecessors, (298), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 350 transitions. [2025-03-03 09:46:27,325 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 350 transitions. Word has length 66 [2025-03-03 09:46:27,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:27,325 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 350 transitions. [2025-03-03 09:46:27,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:27,325 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 350 transitions. [2025-03-03 09:46:27,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 09:46:27,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:27,327 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-03-03 09:46:27,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:46:27,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:27,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:27,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:27,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1263199732, now seen corresponding path program 1 times [2025-03-03 09:46:27,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:27,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067939102] [2025-03-03 09:46:27,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:27,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:27,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 09:46:27,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 09:46:27,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:27,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 09:46:27,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:27,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067939102] [2025-03-03 09:46:27,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067939102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:27,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950742022] [2025-03-03 09:46:27,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:27,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:27,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:27,834 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 09:46:27,835 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 09:46:28,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 09:46:28,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 09:46:28,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:28,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:28,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:46:28,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-03 09:46:28,196 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:28,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950742022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:28,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:28,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:28,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147070336] [2025-03-03 09:46:28,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:28,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:28,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:28,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:28,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:28,198 INFO L87 Difference]: Start difference. First operand 259 states and 350 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:28,231 INFO L93 Difference]: Finished difference Result 501 states and 677 transitions. [2025-03-03 09:46:28,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:28,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2025-03-03 09:46:28,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:28,234 INFO L225 Difference]: With dead ends: 501 [2025-03-03 09:46:28,235 INFO L226 Difference]: Without dead ends: 266 [2025-03-03 09:46:28,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:28,236 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 6 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:28,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 683 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:28,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-03 09:46:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260. [2025-03-03 09:46:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 226 states have (on average 1.323008849557522) internal successors, (299), 230 states have internal predecessors, (299), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 351 transitions. [2025-03-03 09:46:28,263 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 351 transitions. Word has length 70 [2025-03-03 09:46:28,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:28,263 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 351 transitions. [2025-03-03 09:46:28,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 351 transitions. [2025-03-03 09:46:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 09:46:28,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:28,264 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-03-03 09:46:28,271 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 09:46:28,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 09:46:28,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:28,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:28,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1625438621, now seen corresponding path program 1 times [2025-03-03 09:46:28,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:28,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552172554] [2025-03-03 09:46:28,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:28,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:28,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 09:46:28,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 09:46:28,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:28,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 09:46:28,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:28,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552172554] [2025-03-03 09:46:28,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552172554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:28,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971245675] [2025-03-03 09:46:28,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:28,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:28,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:28,708 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 09:46:28,709 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 09:46:28,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 09:46:29,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 09:46:29,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:29,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:29,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:46:29,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 09:46:29,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:29,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971245675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:29,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:29,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:29,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982288098] [2025-03-03 09:46:29,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:29,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:29,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:29,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:29,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:29,080 INFO L87 Difference]: Start difference. First operand 260 states and 351 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:29,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:29,113 INFO L93 Difference]: Finished difference Result 495 states and 668 transitions. [2025-03-03 09:46:29,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:29,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-03-03 09:46:29,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:29,116 INFO L225 Difference]: With dead ends: 495 [2025-03-03 09:46:29,116 INFO L226 Difference]: Without dead ends: 267 [2025-03-03 09:46:29,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:29,117 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 6 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:29,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 682 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-03 09:46:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2025-03-03 09:46:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 227 states have (on average 1.3215859030837005) internal successors, (300), 231 states have internal predecessors, (300), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 352 transitions. [2025-03-03 09:46:29,128 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 352 transitions. Word has length 73 [2025-03-03 09:46:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:29,128 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 352 transitions. [2025-03-03 09:46:29,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 352 transitions. [2025-03-03 09:46:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 09:46:29,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:29,130 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-03-03 09:46:29,137 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 09:46:29,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:29,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:29,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:29,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1597748122, now seen corresponding path program 1 times [2025-03-03 09:46:29,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:29,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774222007] [2025-03-03 09:46:29,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:29,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:29,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 09:46:29,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 09:46:29,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:29,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-03 09:46:29,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:29,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774222007] [2025-03-03 09:46:29,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774222007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:29,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794536221] [2025-03-03 09:46:29,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:29,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:29,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:29,577 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 09:46:29,578 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 09:46:29,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 09:46:29,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 09:46:29,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:29,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:29,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:46:29,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 09:46:29,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:29,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794536221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:29,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:29,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:29,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455334047] [2025-03-03 09:46:29,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:29,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:29,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:29,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:29,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:29,924 INFO L87 Difference]: Start difference. First operand 261 states and 352 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:29,949 INFO L93 Difference]: Finished difference Result 489 states and 659 transitions. [2025-03-03 09:46:29,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:29,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 76 [2025-03-03 09:46:29,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:29,951 INFO L225 Difference]: With dead ends: 489 [2025-03-03 09:46:29,951 INFO L226 Difference]: Without dead ends: 268 [2025-03-03 09:46:29,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:29,952 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 6 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:29,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 682 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-03 09:46:29,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 262. [2025-03-03 09:46:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 228 states have (on average 1.3201754385964912) internal successors, (301), 232 states have internal predecessors, (301), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 353 transitions. [2025-03-03 09:46:29,961 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 353 transitions. Word has length 76 [2025-03-03 09:46:29,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:29,961 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 353 transitions. [2025-03-03 09:46:29,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 353 transitions. [2025-03-03 09:46:29,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 09:46:29,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:29,963 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-03-03 09:46:29,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:30,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:30,167 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:30,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:30,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1536898621, now seen corresponding path program 1 times [2025-03-03 09:46:30,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:30,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667617581] [2025-03-03 09:46:30,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:30,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:30,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 09:46:30,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 09:46:30,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:30,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-03 09:46:30,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:30,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667617581] [2025-03-03 09:46:30,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667617581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:30,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578407873] [2025-03-03 09:46:30,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:30,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:30,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:30,394 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:30,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:46:30,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 09:46:30,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 09:46:30,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:30,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:30,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:46:30,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 09:46:30,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:30,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578407873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:30,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:30,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:30,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466495609] [2025-03-03 09:46:30,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:30,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:30,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:30,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:30,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:30,739 INFO L87 Difference]: Start difference. First operand 262 states and 353 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:30,761 INFO L93 Difference]: Finished difference Result 479 states and 647 transitions. [2025-03-03 09:46:30,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:30,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 79 [2025-03-03 09:46:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:30,763 INFO L225 Difference]: With dead ends: 479 [2025-03-03 09:46:30,763 INFO L226 Difference]: Without dead ends: 269 [2025-03-03 09:46:30,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:30,764 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 6 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:30,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 682 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-03 09:46:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 263. [2025-03-03 09:46:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 229 states have (on average 1.3187772925764192) internal successors, (302), 233 states have internal predecessors, (302), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 354 transitions. [2025-03-03 09:46:30,770 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 354 transitions. Word has length 79 [2025-03-03 09:46:30,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:30,771 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 354 transitions. [2025-03-03 09:46:30,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 354 transitions. [2025-03-03 09:46:30,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 09:46:30,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:30,772 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-03-03 09:46:30,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:30,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:30,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:30,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:30,973 INFO L85 PathProgramCache]: Analyzing trace with hash -571158080, now seen corresponding path program 1 times [2025-03-03 09:46:30,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:30,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791038843] [2025-03-03 09:46:30,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:30,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:31,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 09:46:31,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 09:46:31,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:31,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 09:46:31,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:31,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791038843] [2025-03-03 09:46:31,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791038843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:31,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255963975] [2025-03-03 09:46:31,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:31,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:31,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:31,182 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:31,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:46:31,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 09:46:31,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 09:46:31,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:31,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:31,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:46:31,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 09:46:31,533 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:31,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255963975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:31,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:31,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:31,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000960895] [2025-03-03 09:46:31,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:31,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:31,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:31,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:31,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:31,534 INFO L87 Difference]: Start difference. First operand 263 states and 354 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:31,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:31,627 INFO L93 Difference]: Finished difference Result 330 states and 460 transitions. [2025-03-03 09:46:31,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:31,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 82 [2025-03-03 09:46:31,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:31,629 INFO L225 Difference]: With dead ends: 330 [2025-03-03 09:46:31,629 INFO L226 Difference]: Without dead ends: 321 [2025-03-03 09:46:31,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:31,630 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 93 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:31,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 604 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:46:31,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-03 09:46:31,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 264. [2025-03-03 09:46:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 230 states have (on average 1.317391304347826) internal successors, (303), 234 states have internal predecessors, (303), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 355 transitions. [2025-03-03 09:46:31,636 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 355 transitions. Word has length 82 [2025-03-03 09:46:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:31,636 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 355 transitions. [2025-03-03 09:46:31,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 355 transitions. [2025-03-03 09:46:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 09:46:31,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:31,638 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:46:31,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:31,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:31,842 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:31,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:31,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2009509676, now seen corresponding path program 1 times [2025-03-03 09:46:31,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:31,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742857192] [2025-03-03 09:46:31,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:31,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:31,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 09:46:31,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 09:46:31,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:31,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 09:46:32,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:32,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742857192] [2025-03-03 09:46:32,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742857192] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:32,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482072253] [2025-03-03 09:46:32,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:32,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:32,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:32,047 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:32,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:46:32,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 09:46:32,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 09:46:32,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:32,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:32,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:32,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 09:46:32,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:32,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482072253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:32,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:32,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 09:46:32,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370929625] [2025-03-03 09:46:32,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:32,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:46:32,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:32,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:46:32,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:32,446 INFO L87 Difference]: Start difference. First operand 264 states and 355 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:32,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:32,470 INFO L93 Difference]: Finished difference Result 334 states and 465 transitions. [2025-03-03 09:46:32,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:46:32,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2025-03-03 09:46:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:32,471 INFO L225 Difference]: With dead ends: 334 [2025-03-03 09:46:32,471 INFO L226 Difference]: Without dead ends: 267 [2025-03-03 09:46:32,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:32,472 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:32,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1025 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:32,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-03 09:46:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2025-03-03 09:46:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 232 states have (on average 1.3146551724137931) internal successors, (305), 236 states have internal predecessors, (305), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 357 transitions. [2025-03-03 09:46:32,483 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 357 transitions. Word has length 92 [2025-03-03 09:46:32,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:32,483 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 357 transitions. [2025-03-03 09:46:32,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 357 transitions. [2025-03-03 09:46:32,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 09:46:32,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:32,485 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:46:32,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:32,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:32,686 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:32,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:32,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1503951051, now seen corresponding path program 1 times [2025-03-03 09:46:32,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:32,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249149694] [2025-03-03 09:46:32,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:32,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:32,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 09:46:32,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 09:46:32,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:32,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 09:46:32,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:32,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249149694] [2025-03-03 09:46:32,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249149694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:32,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533322688] [2025-03-03 09:46:32,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:32,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:32,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:32,864 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:32,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:46:33,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 09:46:33,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 09:46:33,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:33,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:33,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:33,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 09:46:33,254 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:33,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533322688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:33,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:33,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 09:46:33,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161361758] [2025-03-03 09:46:33,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:33,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:46:33,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:33,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:46:33,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:33,255 INFO L87 Difference]: Start difference. First operand 266 states and 357 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:33,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:33,273 INFO L93 Difference]: Finished difference Result 338 states and 470 transitions. [2025-03-03 09:46:33,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:46:33,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2025-03-03 09:46:33,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:33,274 INFO L225 Difference]: With dead ends: 338 [2025-03-03 09:46:33,274 INFO L226 Difference]: Without dead ends: 269 [2025-03-03 09:46:33,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:33,275 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:33,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1027 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-03 09:46:33,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-03-03 09:46:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 235 states have (on average 1.3106382978723403) internal successors, (308), 239 states have internal predecessors, (308), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 360 transitions. [2025-03-03 09:46:33,281 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 360 transitions. Word has length 92 [2025-03-03 09:46:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:33,281 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 360 transitions. [2025-03-03 09:46:33,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 360 transitions. [2025-03-03 09:46:33,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 09:46:33,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:33,282 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:46:33,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:33,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 09:46:33,483 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:33,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:33,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1774923443, now seen corresponding path program 1 times [2025-03-03 09:46:33,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:33,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360835398] [2025-03-03 09:46:33,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:33,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:33,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 09:46:33,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 09:46:33,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:33,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:33,654 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 09:46:33,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:33,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360835398] [2025-03-03 09:46:33,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360835398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:33,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448628619] [2025-03-03 09:46:33,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:33,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:33,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:33,657 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:33,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:46:33,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 09:46:34,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 09:46:34,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:34,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:34,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:34,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:34,064 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 09:46:34,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:34,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448628619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:34,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:34,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:34,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497350025] [2025-03-03 09:46:34,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:34,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:34,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:34,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:34,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:34,066 INFO L87 Difference]: Start difference. First operand 269 states and 360 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:34,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:34,076 INFO L93 Difference]: Finished difference Result 341 states and 471 transitions. [2025-03-03 09:46:34,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:34,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 92 [2025-03-03 09:46:34,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:34,078 INFO L225 Difference]: With dead ends: 341 [2025-03-03 09:46:34,078 INFO L226 Difference]: Without dead ends: 332 [2025-03-03 09:46:34,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:34,079 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 83 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 690 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 09:46:34,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 690 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:34,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-03 09:46:34,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2025-03-03 09:46:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 297 states have (on average 1.367003367003367) internal successors, (406), 301 states have internal predecessors, (406), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 458 transitions. [2025-03-03 09:46:34,086 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 458 transitions. Word has length 92 [2025-03-03 09:46:34,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:34,086 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 458 transitions. [2025-03-03 09:46:34,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 458 transitions. [2025-03-03 09:46:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 09:46:34,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:34,087 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-03-03 09:46:34,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:34,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 09:46:34,288 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:34,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:34,288 INFO L85 PathProgramCache]: Analyzing trace with hash -355107272, now seen corresponding path program 1 times [2025-03-03 09:46:34,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:34,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853133523] [2025-03-03 09:46:34,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:34,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:34,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 09:46:34,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 09:46:34,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:34,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 09:46:34,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:34,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853133523] [2025-03-03 09:46:34,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853133523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:34,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627313373] [2025-03-03 09:46:34,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:34,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:34,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:34,478 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:34,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:46:34,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 09:46:34,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 09:46:34,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:34,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:34,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:46:34,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 09:46:34,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:34,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627313373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:34,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:34,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:34,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152828779] [2025-03-03 09:46:34,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:34,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:34,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:34,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:34,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:34,938 INFO L87 Difference]: Start difference. First operand 331 states and 458 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:34,949 INFO L93 Difference]: Finished difference Result 405 states and 573 transitions. [2025-03-03 09:46:34,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:34,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 120 [2025-03-03 09:46:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:34,951 INFO L225 Difference]: With dead ends: 405 [2025-03-03 09:46:34,951 INFO L226 Difference]: Without dead ends: 333 [2025-03-03 09:46:34,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:34,951 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:34,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 689 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-03 09:46:34,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2025-03-03 09:46:34,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 299 states have (on average 1.3645484949832776) internal successors, (408), 303 states have internal predecessors, (408), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 460 transitions. [2025-03-03 09:46:34,960 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 460 transitions. Word has length 120 [2025-03-03 09:46:34,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:34,960 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 460 transitions. [2025-03-03 09:46:34,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:34,960 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 460 transitions. [2025-03-03 09:46:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 09:46:34,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:34,961 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-03-03 09:46:34,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:35,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 09:46:35,166 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:35,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:35,166 INFO L85 PathProgramCache]: Analyzing trace with hash -484189991, now seen corresponding path program 1 times [2025-03-03 09:46:35,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:35,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858811134] [2025-03-03 09:46:35,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:35,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:35,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 09:46:35,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 09:46:35,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:35,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 09:46:35,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:35,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858811134] [2025-03-03 09:46:35,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858811134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:35,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362593435] [2025-03-03 09:46:35,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:35,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:35,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:35,372 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:35,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:46:35,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 09:46:35,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 09:46:35,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:35,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:35,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:35,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:35,804 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 09:46:35,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:35,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362593435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:35,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:35,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 09:46:35,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948555072] [2025-03-03 09:46:35,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:35,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:46:35,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:35,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:46:35,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:35,806 INFO L87 Difference]: Start difference. First operand 333 states and 460 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:35,824 INFO L93 Difference]: Finished difference Result 476 states and 682 transitions. [2025-03-03 09:46:35,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:46:35,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 120 [2025-03-03 09:46:35,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:35,828 INFO L225 Difference]: With dead ends: 476 [2025-03-03 09:46:35,828 INFO L226 Difference]: Without dead ends: 339 [2025-03-03 09:46:35,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:35,829 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:35,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1027 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:35,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-03 09:46:35,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2025-03-03 09:46:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 305 states have (on average 1.3573770491803279) internal successors, (414), 309 states have internal predecessors, (414), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 466 transitions. [2025-03-03 09:46:35,838 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 466 transitions. Word has length 120 [2025-03-03 09:46:35,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:35,839 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 466 transitions. [2025-03-03 09:46:35,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 466 transitions. [2025-03-03 09:46:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 09:46:35,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:35,840 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-03-03 09:46:35,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:36,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 09:46:36,041 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:36,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:36,041 INFO L85 PathProgramCache]: Analyzing trace with hash 541302008, now seen corresponding path program 1 times [2025-03-03 09:46:36,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:36,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945371617] [2025-03-03 09:46:36,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:36,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:36,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 09:46:36,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 09:46:36,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:36,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 09:46:36,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:36,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945371617] [2025-03-03 09:46:36,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945371617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:36,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224813016] [2025-03-03 09:46:36,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:36,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:36,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:36,228 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:36,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:46:36,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 09:46:36,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 09:46:36,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:36,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:36,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:36,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 09:46:36,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:36,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224813016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:36,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:36,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 09:46:36,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801569729] [2025-03-03 09:46:36,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:36,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:46:36,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:36,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:46:36,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:36,650 INFO L87 Difference]: Start difference. First operand 339 states and 466 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:36,672 INFO L93 Difference]: Finished difference Result 488 states and 694 transitions. [2025-03-03 09:46:36,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:46:36,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 120 [2025-03-03 09:46:36,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:36,674 INFO L225 Difference]: With dead ends: 488 [2025-03-03 09:46:36,674 INFO L226 Difference]: Without dead ends: 345 [2025-03-03 09:46:36,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:46:36,674 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:36,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1027 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:36,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-03 09:46:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-03 09:46:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 311 states have (on average 1.3504823151125402) internal successors, (420), 315 states have internal predecessors, (420), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:36,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 472 transitions. [2025-03-03 09:46:36,681 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 472 transitions. Word has length 120 [2025-03-03 09:46:36,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:36,682 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 472 transitions. [2025-03-03 09:46:36,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 472 transitions. [2025-03-03 09:46:36,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 09:46:36,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:36,683 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2025-03-03 09:46:36,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:36,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:46:36,884 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:36,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:36,884 INFO L85 PathProgramCache]: Analyzing trace with hash 572321815, now seen corresponding path program 1 times [2025-03-03 09:46:36,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:36,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726921976] [2025-03-03 09:46:36,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:36,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:36,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 09:46:36,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 09:46:36,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:36,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 09:46:37,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:37,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726921976] [2025-03-03 09:46:37,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726921976] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:37,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549823901] [2025-03-03 09:46:37,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:37,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:37,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:37,046 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:37,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:46:37,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 09:46:37,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 09:46:37,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:37,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:37,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:37,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 09:46:37,541 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:37,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549823901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:37,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:37,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732562958] [2025-03-03 09:46:37,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:37,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:37,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:37,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:37,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:37,543 INFO L87 Difference]: Start difference. First operand 345 states and 472 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:37,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:37,552 INFO L93 Difference]: Finished difference Result 494 states and 696 transitions. [2025-03-03 09:46:37,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:37,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 120 [2025-03-03 09:46:37,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:37,556 INFO L225 Difference]: With dead ends: 494 [2025-03-03 09:46:37,556 INFO L226 Difference]: Without dead ends: 485 [2025-03-03 09:46:37,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:37,557 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 55 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 691 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 09:46:37,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 691 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:37,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-03-03 09:46:37,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2025-03-03 09:46:37,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 451 states have (on average 1.401330376940133) internal successors, (632), 455 states have internal predecessors, (632), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:37,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 684 transitions. [2025-03-03 09:46:37,567 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 684 transitions. Word has length 120 [2025-03-03 09:46:37,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:37,568 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 684 transitions. [2025-03-03 09:46:37,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:37,568 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 684 transitions. [2025-03-03 09:46:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 09:46:37,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:37,570 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:46:37,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 09:46:37,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 09:46:37,770 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:37,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:37,771 INFO L85 PathProgramCache]: Analyzing trace with hash 789065444, now seen corresponding path program 1 times [2025-03-03 09:46:37,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:37,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869278994] [2025-03-03 09:46:37,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:37,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:37,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 09:46:37,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 09:46:37,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:37,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:38,003 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-03 09:46:38,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:38,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869278994] [2025-03-03 09:46:38,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869278994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:38,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916488391] [2025-03-03 09:46:38,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:38,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:38,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:38,007 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:38,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 09:46:38,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 09:46:38,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 09:46:38,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:38,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:38,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:38,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-03 09:46:38,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:38,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916488391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:38,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:38,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:38,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851923094] [2025-03-03 09:46:38,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:38,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:38,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:38,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:38,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:38,471 INFO L87 Difference]: Start difference. First operand 485 states and 684 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:38,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:38,482 INFO L93 Difference]: Finished difference Result 774 states and 1120 transitions. [2025-03-03 09:46:38,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:38,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 130 [2025-03-03 09:46:38,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:38,486 INFO L225 Difference]: With dead ends: 774 [2025-03-03 09:46:38,486 INFO L226 Difference]: Without dead ends: 765 [2025-03-03 09:46:38,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:38,488 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 51 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 690 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 09:46:38,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 690 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:38,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-03-03 09:46:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2025-03-03 09:46:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 731 states have (on average 1.4445964432284542) internal successors, (1056), 735 states have internal predecessors, (1056), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1108 transitions. [2025-03-03 09:46:38,500 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1108 transitions. Word has length 130 [2025-03-03 09:46:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:38,501 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1108 transitions. [2025-03-03 09:46:38,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1108 transitions. [2025-03-03 09:46:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 09:46:38,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:38,502 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:46:38,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:38,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:38,703 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:38,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:38,703 INFO L85 PathProgramCache]: Analyzing trace with hash -388951835, now seen corresponding path program 1 times [2025-03-03 09:46:38,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:38,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505081217] [2025-03-03 09:46:38,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:38,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:38,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 09:46:38,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 09:46:38,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:38,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 09:46:38,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:38,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505081217] [2025-03-03 09:46:38,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505081217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:38,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548317583] [2025-03-03 09:46:38,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:38,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:38,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:38,893 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:38,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 09:46:39,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 09:46:39,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 09:46:39,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:39,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:39,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:39,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 09:46:39,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:39,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548317583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:39,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:39,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:39,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453344087] [2025-03-03 09:46:39,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:39,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:39,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:39,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:39,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:39,407 INFO L87 Difference]: Start difference. First operand 765 states and 1108 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:39,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:39,422 INFO L93 Difference]: Finished difference Result 1334 states and 1968 transitions. [2025-03-03 09:46:39,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:39,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 154 [2025-03-03 09:46:39,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:39,426 INFO L225 Difference]: With dead ends: 1334 [2025-03-03 09:46:39,427 INFO L226 Difference]: Without dead ends: 1325 [2025-03-03 09:46:39,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:39,427 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 48 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 690 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 09:46:39,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 690 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:39,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2025-03-03 09:46:39,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2025-03-03 09:46:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1291 states have (on average 1.474825716498838) internal successors, (1904), 1295 states have internal predecessors, (1904), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:39,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1956 transitions. [2025-03-03 09:46:39,446 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1956 transitions. Word has length 154 [2025-03-03 09:46:39,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:39,446 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1956 transitions. [2025-03-03 09:46:39,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:39,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1956 transitions. [2025-03-03 09:46:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 09:46:39,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:39,449 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:46:39,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-03 09:46:39,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 09:46:39,649 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:39,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:39,650 INFO L85 PathProgramCache]: Analyzing trace with hash 290103724, now seen corresponding path program 1 times [2025-03-03 09:46:39,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:39,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979698467] [2025-03-03 09:46:39,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:39,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:39,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 09:46:39,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 09:46:39,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:39,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-03 09:46:39,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:39,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979698467] [2025-03-03 09:46:39,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979698467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:39,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381196487] [2025-03-03 09:46:39,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:39,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:39,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:39,822 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:39,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 09:46:40,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 09:46:40,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 09:46:40,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:40,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:40,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:40,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:40,364 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-03 09:46:40,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:40,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381196487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:40,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:40,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:40,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810892268] [2025-03-03 09:46:40,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:40,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:40,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:40,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:40,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:40,365 INFO L87 Difference]: Start difference. First operand 1325 states and 1956 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:40,382 INFO L93 Difference]: Finished difference Result 2454 states and 3664 transitions. [2025-03-03 09:46:40,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:40,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 170 [2025-03-03 09:46:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:40,389 INFO L225 Difference]: With dead ends: 2454 [2025-03-03 09:46:40,389 INFO L226 Difference]: Without dead ends: 2445 [2025-03-03 09:46:40,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:40,391 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 45 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:40,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 689 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2025-03-03 09:46:40,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2445. [2025-03-03 09:46:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 2411 states have (on average 1.4931563666528411) internal successors, (3600), 2415 states have internal predecessors, (3600), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3652 transitions. [2025-03-03 09:46:40,425 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3652 transitions. Word has length 170 [2025-03-03 09:46:40,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:40,425 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 3652 transitions. [2025-03-03 09:46:40,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3652 transitions. [2025-03-03 09:46:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-03 09:46:40,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:40,429 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:46:40,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-03 09:46:40,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 09:46:40,630 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:40,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:40,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1186272199, now seen corresponding path program 1 times [2025-03-03 09:46:40,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:40,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573272587] [2025-03-03 09:46:40,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:40,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:40,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 09:46:40,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 09:46:40,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:40,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-03 09:46:40,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:40,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573272587] [2025-03-03 09:46:40,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573272587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:40,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268807067] [2025-03-03 09:46:40,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:40,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:40,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:40,841 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:40,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 09:46:41,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 09:46:41,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 09:46:41,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:41,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:41,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:46:41,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-03 09:46:41,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:41,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268807067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:41,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:41,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:41,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111698072] [2025-03-03 09:46:41,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:41,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:41,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:41,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:41,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:41,356 INFO L87 Difference]: Start difference. First operand 2445 states and 3652 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:41,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:41,374 INFO L93 Difference]: Finished difference Result 3606 states and 5424 transitions. [2025-03-03 09:46:41,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:41,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 200 [2025-03-03 09:46:41,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:41,381 INFO L225 Difference]: With dead ends: 3606 [2025-03-03 09:46:41,381 INFO L226 Difference]: Without dead ends: 2477 [2025-03-03 09:46:41,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:41,383 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:41,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 689 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:41,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2025-03-03 09:46:41,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2477. [2025-03-03 09:46:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2443 states have (on average 1.4866966844044207) internal successors, (3632), 2447 states have internal predecessors, (3632), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3684 transitions. [2025-03-03 09:46:41,416 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3684 transitions. Word has length 200 [2025-03-03 09:46:41,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:41,416 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 3684 transitions. [2025-03-03 09:46:41,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3684 transitions. [2025-03-03 09:46:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-03 09:46:41,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:41,420 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:46:41,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-03 09:46:41,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 09:46:41,621 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:41,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:41,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1558568488, now seen corresponding path program 1 times [2025-03-03 09:46:41,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:41,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659296638] [2025-03-03 09:46:41,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:41,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:41,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 09:46:41,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 09:46:41,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:41,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-03 09:46:41,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:41,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659296638] [2025-03-03 09:46:41,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659296638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:41,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557038172] [2025-03-03 09:46:41,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:41,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:41,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:41,814 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:41,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 09:46:42,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 09:46:42,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 09:46:42,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:42,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:42,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:42,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-03 09:46:42,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:42,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557038172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:42,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:42,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:42,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305244934] [2025-03-03 09:46:42,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:42,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:42,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:42,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:42,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:42,433 INFO L87 Difference]: Start difference. First operand 2477 states and 3684 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:42,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:42,452 INFO L93 Difference]: Finished difference Result 4758 states and 7120 transitions. [2025-03-03 09:46:42,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:42,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 200 [2025-03-03 09:46:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:42,465 INFO L225 Difference]: With dead ends: 4758 [2025-03-03 09:46:42,465 INFO L226 Difference]: Without dead ends: 4749 [2025-03-03 09:46:42,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:42,467 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 43 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 690 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 09:46:42,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 690 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:42,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4749 states. [2025-03-03 09:46:42,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4749 to 4749. [2025-03-03 09:46:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4749 states, 4715 states have (on average 1.4965005302226935) internal successors, (7056), 4719 states have internal predecessors, (7056), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4749 states to 4749 states and 7108 transitions. [2025-03-03 09:46:42,527 INFO L78 Accepts]: Start accepts. Automaton has 4749 states and 7108 transitions. Word has length 200 [2025-03-03 09:46:42,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:42,527 INFO L471 AbstractCegarLoop]: Abstraction has 4749 states and 7108 transitions. [2025-03-03 09:46:42,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 4749 states and 7108 transitions. [2025-03-03 09:46:42,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-03 09:46:42,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:42,534 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:46:42,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-03 09:46:42,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:42,735 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:42,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:42,735 INFO L85 PathProgramCache]: Analyzing trace with hash -546773065, now seen corresponding path program 1 times [2025-03-03 09:46:42,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:42,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3889424] [2025-03-03 09:46:42,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:42,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:42,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-03 09:46:42,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-03 09:46:42,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:42,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-03-03 09:46:42,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:42,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3889424] [2025-03-03 09:46:42,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3889424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:42,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325796138] [2025-03-03 09:46:42,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:42,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:42,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:42,995 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:42,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 09:46:43,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-03 09:46:43,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-03 09:46:43,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:43,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:43,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:43,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:43,698 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-03-03 09:46:43,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:43,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325796138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:43,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:43,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:43,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335660591] [2025-03-03 09:46:43,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:43,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:43,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:43,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:43,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:43,699 INFO L87 Difference]: Start difference. First operand 4749 states and 7108 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:43,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:43,725 INFO L93 Difference]: Finished difference Result 9302 states and 13968 transitions. [2025-03-03 09:46:43,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:43,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 252 [2025-03-03 09:46:43,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:43,747 INFO L225 Difference]: With dead ends: 9302 [2025-03-03 09:46:43,747 INFO L226 Difference]: Without dead ends: 9293 [2025-03-03 09:46:43,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:43,751 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 27 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:43,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 689 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:43,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9293 states. [2025-03-03 09:46:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9293 to 9293. [2025-03-03 09:46:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9293 states, 9259 states have (on average 1.5016740468733125) internal successors, (13904), 9263 states have internal predecessors, (13904), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9293 states to 9293 states and 13956 transitions. [2025-03-03 09:46:43,875 INFO L78 Accepts]: Start accepts. Automaton has 9293 states and 13956 transitions. Word has length 252 [2025-03-03 09:46:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:43,875 INFO L471 AbstractCegarLoop]: Abstraction has 9293 states and 13956 transitions. [2025-03-03 09:46:43,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 9293 states and 13956 transitions. [2025-03-03 09:46:43,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 09:46:43,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:43,889 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:46:43,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:44,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:44,089 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:44,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:44,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1280385270, now seen corresponding path program 1 times [2025-03-03 09:46:44,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:44,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970640485] [2025-03-03 09:46:44,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:44,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 09:46:44,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 09:46:44,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:44,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2025-03-03 09:46:44,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:44,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970640485] [2025-03-03 09:46:44,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970640485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:44,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708970759] [2025-03-03 09:46:44,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:44,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:44,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:44,321 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:44,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-03 09:46:44,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 09:46:44,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 09:46:44,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:44,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:44,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:44,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:45,048 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-03-03 09:46:45,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:46:45,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708970759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:45,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:46:45,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:46:45,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351834468] [2025-03-03 09:46:45,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:45,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:46:45,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:45,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:46:45,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:45,050 INFO L87 Difference]: Start difference. First operand 9293 states and 13956 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:45,124 INFO L93 Difference]: Finished difference Result 18390 states and 27664 transitions. [2025-03-03 09:46:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:46:45,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 296 [2025-03-03 09:46:45,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:45,150 INFO L225 Difference]: With dead ends: 18390 [2025-03-03 09:46:45,151 INFO L226 Difference]: Without dead ends: 18381 [2025-03-03 09:46:45,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:46:45,157 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 26 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:45,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 689 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:45,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18381 states. [2025-03-03 09:46:45,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18381 to 18381. [2025-03-03 09:46:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18381 states, 18347 states have (on average 1.5043331334823131) internal successors, (27600), 18351 states have internal predecessors, (27600), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18381 states to 18381 states and 27652 transitions. [2025-03-03 09:46:45,369 INFO L78 Accepts]: Start accepts. Automaton has 18381 states and 27652 transitions. Word has length 296 [2025-03-03 09:46:45,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:45,369 INFO L471 AbstractCegarLoop]: Abstraction has 18381 states and 27652 transitions. [2025-03-03 09:46:45,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:46:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 18381 states and 27652 transitions. [2025-03-03 09:46:45,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-03 09:46:45,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:45,394 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:46:45,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:45,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-03 09:46:45,596 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:45,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:45,596 INFO L85 PathProgramCache]: Analyzing trace with hash 416556439, now seen corresponding path program 1 times [2025-03-03 09:46:45,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:45,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101261023] [2025-03-03 09:46:45,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:45,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:45,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-03 09:46:45,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-03 09:46:45,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:45,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-03 09:46:45,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:45,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101261023] [2025-03-03 09:46:45,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101261023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:45,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274186646] [2025-03-03 09:46:45,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:45,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:45,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:45,874 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:45,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-03 09:46:46,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-03 09:46:46,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-03 09:46:46,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:46,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:46,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:46:46,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-03 09:46:46,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:46:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-03 09:46:46,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274186646] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:46:46,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:46:46,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 09:46:46,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442184603] [2025-03-03 09:46:46,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:46:46,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:46:46,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:46,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:46:46,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:46:46,574 INFO L87 Difference]: Start difference. First operand 18381 states and 27652 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 09:46:46,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:46,664 INFO L93 Difference]: Finished difference Result 36761 states and 55305 transitions. [2025-03-03 09:46:46,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:46:46,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 354 [2025-03-03 09:46:46,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:46,690 INFO L225 Difference]: With dead ends: 36761 [2025-03-03 09:46:46,691 INFO L226 Difference]: Without dead ends: 18384 [2025-03-03 09:46:46,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:46:46,714 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 0 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:46,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1379 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:46,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18384 states. [2025-03-03 09:46:46,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18384 to 18384. [2025-03-03 09:46:46,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18384 states, 18350 states have (on average 1.50425068119891) internal successors, (27603), 18354 states have internal predecessors, (27603), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18384 states to 18384 states and 27655 transitions. [2025-03-03 09:46:46,982 INFO L78 Accepts]: Start accepts. Automaton has 18384 states and 27655 transitions. Word has length 354 [2025-03-03 09:46:46,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:46,982 INFO L471 AbstractCegarLoop]: Abstraction has 18384 states and 27655 transitions. [2025-03-03 09:46:46,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 1 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 09:46:46,982 INFO L276 IsEmpty]: Start isEmpty. Operand 18384 states and 27655 transitions. [2025-03-03 09:46:47,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-03 09:46:47,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:47,013 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:46:47,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-03 09:46:47,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 09:46:47,214 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:47,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:47,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1001234875, now seen corresponding path program 2 times [2025-03-03 09:46:47,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:47,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658820637] [2025-03-03 09:46:47,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:46:47,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:47,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 357 statements into 2 equivalence classes. [2025-03-03 09:46:47,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 357 of 357 statements. [2025-03-03 09:46:47,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:46:47,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:47,565 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2025-03-03 09:46:47,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:47,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658820637] [2025-03-03 09:46:47,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658820637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:47,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936837853] [2025-03-03 09:46:47,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:46:47,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:47,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:47,568 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:47,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-03 09:46:48,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 357 statements into 2 equivalence classes. [2025-03-03 09:46:51,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 357 of 357 statements. [2025-03-03 09:46:51,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:46:51,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:51,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 1422 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:46:51,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-03 09:46:51,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:46:51,266 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-03 09:46:51,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936837853] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:46:51,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:46:51,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-03 09:46:51,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19903350] [2025-03-03 09:46:51,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:46:51,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:46:51,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:51,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:46:51,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:46:51,268 INFO L87 Difference]: Start difference. First operand 18384 states and 27655 transitions. Second operand has 14 states, 14 states have (on average 10.857142857142858) internal successors, (152), 14 states have internal predecessors, (152), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 09:46:51,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:51,359 INFO L93 Difference]: Finished difference Result 36768 states and 55320 transitions. [2025-03-03 09:46:51,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 09:46:51,359 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.857142857142858) internal successors, (152), 14 states have internal predecessors, (152), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 357 [2025-03-03 09:46:51,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:51,386 INFO L225 Difference]: With dead ends: 36768 [2025-03-03 09:46:51,386 INFO L226 Difference]: Without dead ends: 18391 [2025-03-03 09:46:51,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:46:51,406 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 0 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:51,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1719 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:46:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18391 states. [2025-03-03 09:46:51,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18391 to 18391. [2025-03-03 09:46:51,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18391 states, 18357 states have (on average 1.5040583973416135) internal successors, (27610), 18361 states have internal predecessors, (27610), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 09:46:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18391 states to 18391 states and 27662 transitions. [2025-03-03 09:46:51,579 INFO L78 Accepts]: Start accepts. Automaton has 18391 states and 27662 transitions. Word has length 357 [2025-03-03 09:46:51,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:51,579 INFO L471 AbstractCegarLoop]: Abstraction has 18391 states and 27662 transitions. [2025-03-03 09:46:51,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.857142857142858) internal successors, (152), 14 states have internal predecessors, (152), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 09:46:51,579 INFO L276 IsEmpty]: Start isEmpty. Operand 18391 states and 27662 transitions. [2025-03-03 09:46:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-03 09:46:51,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:51,596 INFO L218 NwaCegarLoop]: trace histogram [10, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:46:51,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-03 09:46:51,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:51,797 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:51,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:51,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1973642057, now seen corresponding path program 3 times [2025-03-03 09:46:51,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:51,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829076513] [2025-03-03 09:46:51,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:46:51,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:51,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 367 statements into 9 equivalence classes. [2025-03-03 09:46:52,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 69 of 367 statements. [2025-03-03 09:46:52,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:46:52,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:52,478 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2025-03-03 09:46:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:52,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829076513] [2025-03-03 09:46:52,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829076513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:46:52,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:46:52,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 09:46:52,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789644856] [2025-03-03 09:46:52,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:46:52,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:46:52,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:46:52,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:46:52,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:46:52,480 INFO L87 Difference]: Start difference. First operand 18391 states and 27662 transitions. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:46:58,443 INFO L93 Difference]: Finished difference Result 36724 states and 55260 transitions. [2025-03-03 09:46:58,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:46:58,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 367 [2025-03-03 09:46:58,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:46:58,466 INFO L225 Difference]: With dead ends: 36724 [2025-03-03 09:46:58,466 INFO L226 Difference]: Without dead ends: 18526 [2025-03-03 09:46:58,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:46:58,484 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 340 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:46:58,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1571 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-03-03 09:46:58,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18526 states. [2025-03-03 09:46:58,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18526 to 18487. [2025-03-03 09:46:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18487 states, 18438 states have (on average 1.5027117908666883) internal successors, (27707), 18446 states have internal predecessors, (27707), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 35 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-03 09:46:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18487 states to 18487 states and 27789 transitions. [2025-03-03 09:46:58,677 INFO L78 Accepts]: Start accepts. Automaton has 18487 states and 27789 transitions. Word has length 367 [2025-03-03 09:46:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:46:58,678 INFO L471 AbstractCegarLoop]: Abstraction has 18487 states and 27789 transitions. [2025-03-03 09:46:58,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 09:46:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 18487 states and 27789 transitions. [2025-03-03 09:46:58,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-03 09:46:58,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:46:58,695 INFO L218 NwaCegarLoop]: trace histogram [10, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:46:58,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 09:46:58,695 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:46:58,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:46:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash -936774260, now seen corresponding path program 1 times [2025-03-03 09:46:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:46:58,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892186763] [2025-03-03 09:46:58,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:58,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:46:58,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-03 09:46:58,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-03 09:46:58,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:58,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:59,074 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2025-03-03 09:46:59,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:46:59,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892186763] [2025-03-03 09:46:59,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892186763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:46:59,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229020632] [2025-03-03 09:46:59,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:46:59,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:46:59,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:46:59,076 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:46:59,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-03 09:46:59,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-03 09:46:59,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-03 09:46:59,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:46:59,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:46:59,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 1829 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:46:59,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:46:59,955 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-03-03 09:46:59,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:47:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-03-03 09:47:00,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229020632] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:47:00,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:47:00,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 13] total 18 [2025-03-03 09:47:00,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622282974] [2025-03-03 09:47:00,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:47:00,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:47:00,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:00,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:47:00,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:47:00,098 INFO L87 Difference]: Start difference. First operand 18487 states and 27789 transitions. Second operand has 18 states, 18 states have (on average 10.38888888888889) internal successors, (187), 18 states have internal predecessors, (187), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 09:47:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:00,294 INFO L93 Difference]: Finished difference Result 36978 states and 55590 transitions. [2025-03-03 09:47:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 09:47:00,295 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 10.38888888888889) internal successors, (187), 18 states have internal predecessors, (187), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 391 [2025-03-03 09:47:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:00,315 INFO L225 Difference]: With dead ends: 36978 [2025-03-03 09:47:00,315 INFO L226 Difference]: Without dead ends: 18504 [2025-03-03 09:47:00,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 760 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:47:00,325 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 10 mSDsluCounter, 2033 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:00,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2375 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:47:00,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18504 states. [2025-03-03 09:47:00,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18504 to 18498. [2025-03-03 09:47:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18498 states, 18448 states have (on average 1.5024934952298352) internal successors, (27718), 18456 states have internal predecessors, (27718), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 36 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 09:47:00,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18498 states to 18498 states and 27802 transitions. [2025-03-03 09:47:00,500 INFO L78 Accepts]: Start accepts. Automaton has 18498 states and 27802 transitions. Word has length 391 [2025-03-03 09:47:00,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:00,500 INFO L471 AbstractCegarLoop]: Abstraction has 18498 states and 27802 transitions. [2025-03-03 09:47:00,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.38888888888889) internal successors, (187), 18 states have internal predecessors, (187), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 09:47:00,500 INFO L276 IsEmpty]: Start isEmpty. Operand 18498 states and 27802 transitions. [2025-03-03 09:47:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-03-03 09:47:00,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:00,517 INFO L218 NwaCegarLoop]: trace histogram [14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:00,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-03 09:47:00,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:47:00,721 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:00,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:00,722 INFO L85 PathProgramCache]: Analyzing trace with hash -173955719, now seen corresponding path program 2 times [2025-03-03 09:47:00,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:00,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827195445] [2025-03-03 09:47:00,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:47:00,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:00,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 398 statements into 2 equivalence classes. [2025-03-03 09:47:00,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 398 of 398 statements. [2025-03-03 09:47:00,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:47:00,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2025-03-03 09:47:01,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:01,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827195445] [2025-03-03 09:47:01,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827195445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:47:01,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375672321] [2025-03-03 09:47:01,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:47:01,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:47:01,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:47:01,084 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:47:01,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-03 09:47:01,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 398 statements into 2 equivalence classes. [2025-03-03 09:47:03,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 398 of 398 statements. [2025-03-03 09:47:03,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:47:03,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:03,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 1893 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:47:03,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:47:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2025-03-03 09:47:03,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:47:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2025-03-03 09:47:03,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375672321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:47:03,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:47:03,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-03-03 09:47:03,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510216099] [2025-03-03 09:47:03,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:47:03,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:47:03,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:03,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:47:03,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:47:03,525 INFO L87 Difference]: Start difference. First operand 18498 states and 27802 transitions. Second operand has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:47:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:03,750 INFO L93 Difference]: Finished difference Result 36991 states and 55605 transitions. [2025-03-03 09:47:03,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:47:03,751 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 398 [2025-03-03 09:47:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:03,771 INFO L225 Difference]: With dead ends: 36991 [2025-03-03 09:47:03,771 INFO L226 Difference]: Without dead ends: 18539 [2025-03-03 09:47:03,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 790 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:47:03,779 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 47 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:03,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 2036 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:47:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18539 states. [2025-03-03 09:47:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18539 to 18533. [2025-03-03 09:47:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18533 states, 18478 states have (on average 1.5019482627990042) internal successors, (27753), 18486 states have internal predecessors, (27753), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 41 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-03 09:47:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18533 states to 18533 states and 27847 transitions. [2025-03-03 09:47:03,945 INFO L78 Accepts]: Start accepts. Automaton has 18533 states and 27847 transitions. Word has length 398 [2025-03-03 09:47:03,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:03,946 INFO L471 AbstractCegarLoop]: Abstraction has 18533 states and 27847 transitions. [2025-03-03 09:47:03,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 09:47:03,946 INFO L276 IsEmpty]: Start isEmpty. Operand 18533 states and 27847 transitions. [2025-03-03 09:47:03,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-03-03 09:47:03,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:03,963 INFO L218 NwaCegarLoop]: trace histogram [14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:03,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-03 09:47:04,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 09:47:04,165 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:04,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:04,166 INFO L85 PathProgramCache]: Analyzing trace with hash -660587534, now seen corresponding path program 3 times [2025-03-03 09:47:04,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:04,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873905082] [2025-03-03 09:47:04,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:47:04,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:04,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 413 statements into 9 equivalence classes. [2025-03-03 09:47:04,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 93 of 413 statements. [2025-03-03 09:47:04,439 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:47:04,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2025-03-03 09:47:05,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:05,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873905082] [2025-03-03 09:47:05,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873905082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:47:05,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:47:05,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 09:47:05,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470887735] [2025-03-03 09:47:05,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:47:05,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:47:05,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:05,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:47:05,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:47:05,510 INFO L87 Difference]: Start difference. First operand 18533 states and 27847 transitions. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 09:47:06,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 09:47:08,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 09:47:10,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 09:47:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:12,432 INFO L93 Difference]: Finished difference Result 37131 states and 55794 transitions. [2025-03-03 09:47:12,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:47:12,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 413 [2025-03-03 09:47:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:12,454 INFO L225 Difference]: With dead ends: 37131 [2025-03-03 09:47:12,455 INFO L226 Difference]: Without dead ends: 18714 [2025-03-03 09:47:12,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:47:12,473 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 160 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:12,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1770 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2025-03-03 09:47:12,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18714 states. [2025-03-03 09:47:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18714 to 18616. [2025-03-03 09:47:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18616 states, 18548 states have (on average 1.5008087125296528) internal successors, (27837), 18560 states have internal predecessors, (27837), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 51 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 09:47:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18616 states to 18616 states and 27957 transitions. [2025-03-03 09:47:12,697 INFO L78 Accepts]: Start accepts. Automaton has 18616 states and 27957 transitions. Word has length 413 [2025-03-03 09:47:12,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:12,697 INFO L471 AbstractCegarLoop]: Abstraction has 18616 states and 27957 transitions. [2025-03-03 09:47:12,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 3 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 09:47:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 18616 states and 27957 transitions. [2025-03-03 09:47:12,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-03 09:47:12,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:12,721 INFO L218 NwaCegarLoop]: trace histogram [14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:12,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 09:47:12,721 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:12,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:12,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1846975065, now seen corresponding path program 1 times [2025-03-03 09:47:12,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:12,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73156453] [2025-03-03 09:47:12,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:47:12,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:12,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-03 09:47:12,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-03 09:47:12,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:47:12,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 932 trivial. 0 not checked. [2025-03-03 09:47:13,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:13,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73156453] [2025-03-03 09:47:13,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73156453] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:47:13,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701818734] [2025-03-03 09:47:13,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:47:13,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:47:13,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:47:13,181 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:47:13,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-03 09:47:13,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-03 09:47:14,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-03 09:47:14,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:47:14,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:14,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 2089 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:47:14,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:47:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 879 trivial. 0 not checked. [2025-03-03 09:47:14,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:47:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 09:47:14,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701818734] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:47:14,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:47:14,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 18 [2025-03-03 09:47:14,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132977782] [2025-03-03 09:47:14,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:47:14,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:47:14,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:14,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:47:14,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:47:14,278 INFO L87 Difference]: Start difference. First operand 18616 states and 27957 transitions. Second operand has 18 states, 18 states have (on average 12.055555555555555) internal successors, (217), 18 states have internal predecessors, (217), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 09:47:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:14,536 INFO L93 Difference]: Finished difference Result 37227 states and 55919 transitions. [2025-03-03 09:47:14,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 09:47:14,537 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 12.055555555555555) internal successors, (217), 18 states have internal predecessors, (217), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 433 [2025-03-03 09:47:14,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:14,555 INFO L225 Difference]: With dead ends: 37227 [2025-03-03 09:47:14,555 INFO L226 Difference]: Without dead ends: 18685 [2025-03-03 09:47:14,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 868 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:47:14,571 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 109 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:14,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 2738 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:47:14,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18685 states. [2025-03-03 09:47:14,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18685 to 18679. [2025-03-03 09:47:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18679 states, 18602 states have (on average 1.4998387270186002) internal successors, (27900), 18614 states have internal predecessors, (27900), 69 states have call successors, (69), 7 states have call predecessors, (69), 7 states have return successors, (69), 60 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-03 09:47:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18679 states to 18679 states and 28038 transitions. [2025-03-03 09:47:14,747 INFO L78 Accepts]: Start accepts. Automaton has 18679 states and 28038 transitions. Word has length 433 [2025-03-03 09:47:14,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:14,747 INFO L471 AbstractCegarLoop]: Abstraction has 18679 states and 28038 transitions. [2025-03-03 09:47:14,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.055555555555555) internal successors, (217), 18 states have internal predecessors, (217), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 09:47:14,747 INFO L276 IsEmpty]: Start isEmpty. Operand 18679 states and 28038 transitions. [2025-03-03 09:47:14,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-03 09:47:14,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:14,765 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:14,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-03 09:47:14,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-03 09:47:14,966 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:14,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:14,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1665226476, now seen corresponding path program 2 times [2025-03-03 09:47:14,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:14,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162713453] [2025-03-03 09:47:14,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:47:14,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:15,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 460 statements into 2 equivalence classes. [2025-03-03 09:47:15,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 460 of 460 statements. [2025-03-03 09:47:15,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:47:15,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:15,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2025-03-03 09:47:15,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:15,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162713453] [2025-03-03 09:47:15,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162713453] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:47:15,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619167701] [2025-03-03 09:47:15,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:47:15,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:47:15,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:47:15,335 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:47:15,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-03 09:47:16,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 460 statements into 2 equivalence classes. [2025-03-03 09:47:17,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 460 of 460 statements. [2025-03-03 09:47:17,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:47:17,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:17,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 2125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:47:17,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:47:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1165 trivial. 0 not checked. [2025-03-03 09:47:17,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:47:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1168 trivial. 0 not checked. [2025-03-03 09:47:17,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619167701] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:47:17,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:47:17,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-03-03 09:47:17,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131056836] [2025-03-03 09:47:17,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:47:17,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:47:17,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:17,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:47:17,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:47:17,538 INFO L87 Difference]: Start difference. First operand 18679 states and 28038 transitions. Second operand has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 09:47:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:17,700 INFO L93 Difference]: Finished difference Result 37254 states and 55949 transitions. [2025-03-03 09:47:17,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:47:17,701 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 460 [2025-03-03 09:47:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:17,718 INFO L225 Difference]: With dead ends: 37254 [2025-03-03 09:47:17,718 INFO L226 Difference]: Without dead ends: 18720 [2025-03-03 09:47:17,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 922 GetRequests, 914 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:47:17,732 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 67 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:17,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1021 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:47:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18720 states. [2025-03-03 09:47:17,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18720 to 18714. [2025-03-03 09:47:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18714 states, 18632 states have (on average 1.4993022756547874) internal successors, (27935), 18644 states have internal predecessors, (27935), 74 states have call successors, (74), 7 states have call predecessors, (74), 7 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 09:47:17,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18714 states to 18714 states and 28083 transitions. [2025-03-03 09:47:17,894 INFO L78 Accepts]: Start accepts. Automaton has 18714 states and 28083 transitions. Word has length 460 [2025-03-03 09:47:17,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:17,894 INFO L471 AbstractCegarLoop]: Abstraction has 18714 states and 28083 transitions. [2025-03-03 09:47:17,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 09:47:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 18714 states and 28083 transitions. [2025-03-03 09:47:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-03 09:47:17,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:17,911 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:17,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-03 09:47:18,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 09:47:18,112 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:18,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:18,115 INFO L85 PathProgramCache]: Analyzing trace with hash -2084418163, now seen corresponding path program 3 times [2025-03-03 09:47:18,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:18,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127973311] [2025-03-03 09:47:18,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:47:18,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:18,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 475 statements into 16 equivalence classes. [2025-03-03 09:47:19,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 145 of 475 statements. [2025-03-03 09:47:19,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:47:19,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 82 proven. 2 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2025-03-03 09:47:19,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:19,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127973311] [2025-03-03 09:47:19,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127973311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:47:19,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131622393] [2025-03-03 09:47:19,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:47:19,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:47:19,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:47:19,631 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:47:19,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-03 09:47:20,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 475 statements into 16 equivalence classes. [2025-03-03 09:47:31,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 145 of 475 statements. [2025-03-03 09:47:31,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:47:31,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:31,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:47:31,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:47:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 82 proven. 2 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2025-03-03 09:47:31,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:47:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 82 proven. 2 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2025-03-03 09:47:31,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131622393] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:47:31,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:47:31,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 09:47:31,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984626078] [2025-03-03 09:47:31,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:47:31,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:47:31,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:31,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:47:31,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:47:31,895 INFO L87 Difference]: Start difference. First operand 18714 states and 28083 transitions. Second operand has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:32,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:32,086 INFO L93 Difference]: Finished difference Result 23395 states and 35071 transitions. [2025-03-03 09:47:32,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:47:32,086 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 475 [2025-03-03 09:47:32,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:32,109 INFO L225 Difference]: With dead ends: 23395 [2025-03-03 09:47:32,109 INFO L226 Difference]: Without dead ends: 23386 [2025-03-03 09:47:32,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 957 GetRequests, 949 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:47:32,117 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 686 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:32,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 951 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:47:32,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23386 states. [2025-03-03 09:47:32,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23386 to 14170. [2025-03-03 09:47:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14170 states, 14088 states have (on average 1.4968057921635434) internal successors, (21087), 14100 states have internal predecessors, (21087), 74 states have call successors, (74), 7 states have call predecessors, (74), 7 states have return successors, (74), 65 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 09:47:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14170 states to 14170 states and 21235 transitions. [2025-03-03 09:47:32,317 INFO L78 Accepts]: Start accepts. Automaton has 14170 states and 21235 transitions. Word has length 475 [2025-03-03 09:47:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:32,317 INFO L471 AbstractCegarLoop]: Abstraction has 14170 states and 21235 transitions. [2025-03-03 09:47:32,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 14170 states and 21235 transitions. [2025-03-03 09:47:32,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-03 09:47:32,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:32,332 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:32,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-03 09:47:32,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:47:32,533 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:32,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:32,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1780584525, now seen corresponding path program 4 times [2025-03-03 09:47:32,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:32,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402425525] [2025-03-03 09:47:32,533 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:47:32,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:32,694 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 475 statements into 2 equivalence classes. [2025-03-03 09:47:32,727 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 475 of 475 statements. [2025-03-03 09:47:32,727 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:47:32,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2025-03-03 09:47:33,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:33,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402425525] [2025-03-03 09:47:33,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402425525] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:47:33,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733777085] [2025-03-03 09:47:33,022 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:47:33,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:47:33,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:47:33,027 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:47:33,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-03 09:47:33,772 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 475 statements into 2 equivalence classes. [2025-03-03 09:47:34,241 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 475 of 475 statements. [2025-03-03 09:47:34,241 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:47:34,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:34,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 2145 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:47:34,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:47:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 1169 trivial. 0 not checked. [2025-03-03 09:47:34,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:47:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1223 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2025-03-03 09:47:34,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733777085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:47:34,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:47:34,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-03 09:47:34,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837628196] [2025-03-03 09:47:34,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:47:34,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 09:47:34,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:34,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 09:47:34,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:47:34,382 INFO L87 Difference]: Start difference. First operand 14170 states and 21235 transitions. Second operand has 16 states, 16 states have (on average 12.75) internal successors, (204), 16 states have internal predecessors, (204), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 09:47:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:34,577 INFO L93 Difference]: Finished difference Result 28223 states and 42329 transitions. [2025-03-03 09:47:34,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 09:47:34,578 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.75) internal successors, (204), 16 states have internal predecessors, (204), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 475 [2025-03-03 09:47:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:34,591 INFO L225 Difference]: With dead ends: 28223 [2025-03-03 09:47:34,591 INFO L226 Difference]: Without dead ends: 14226 [2025-03-03 09:47:34,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 957 GetRequests, 943 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:47:34,603 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 89 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:34,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 2070 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:47:34,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14226 states. [2025-03-03 09:47:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14226 to 14226. [2025-03-03 09:47:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14226 states, 14136 states have (on average 1.4956847764572723) internal successors, (21143), 14148 states have internal predecessors, (21143), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 09:47:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14226 states to 14226 states and 21307 transitions. [2025-03-03 09:47:34,727 INFO L78 Accepts]: Start accepts. Automaton has 14226 states and 21307 transitions. Word has length 475 [2025-03-03 09:47:34,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:34,728 INFO L471 AbstractCegarLoop]: Abstraction has 14226 states and 21307 transitions. [2025-03-03 09:47:34,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.75) internal successors, (204), 16 states have internal predecessors, (204), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 09:47:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 14226 states and 21307 transitions. [2025-03-03 09:47:34,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-03 09:47:34,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:34,740 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:34,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-03 09:47:34,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:47:34,941 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:34,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:34,941 INFO L85 PathProgramCache]: Analyzing trace with hash 403491533, now seen corresponding path program 5 times [2025-03-03 09:47:34,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:34,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926332461] [2025-03-03 09:47:34,941 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:47:34,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:35,091 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 499 statements into 16 equivalence classes. [2025-03-03 09:47:35,095 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 106 of 499 statements. [2025-03-03 09:47:35,095 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-03 09:47:35,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2025-03-03 09:47:35,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:35,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926332461] [2025-03-03 09:47:35,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926332461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:47:35,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:47:35,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:47:35,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846556992] [2025-03-03 09:47:35,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:47:35,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:47:35,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:35,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:47:35,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:47:35,148 INFO L87 Difference]: Start difference. First operand 14226 states and 21307 transitions. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:35,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:35,375 INFO L93 Difference]: Finished difference Result 30747 states and 46279 transitions. [2025-03-03 09:47:35,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:47:35,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-03-03 09:47:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:35,387 INFO L225 Difference]: With dead ends: 30747 [2025-03-03 09:47:35,387 INFO L226 Difference]: Without dead ends: 17106 [2025-03-03 09:47:35,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:47:35,391 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 30 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:35,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 960 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:47:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17106 states. [2025-03-03 09:47:35,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17106 to 15762. [2025-03-03 09:47:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15762 states, 15672 states have (on average 1.496107708014293) internal successors, (23447), 15684 states have internal predecessors, (23447), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 09:47:35,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15762 states to 15762 states and 23611 transitions. [2025-03-03 09:47:35,542 INFO L78 Accepts]: Start accepts. Automaton has 15762 states and 23611 transitions. Word has length 499 [2025-03-03 09:47:35,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:35,542 INFO L471 AbstractCegarLoop]: Abstraction has 15762 states and 23611 transitions. [2025-03-03 09:47:35,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 15762 states and 23611 transitions. [2025-03-03 09:47:35,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-03 09:47:35,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:35,557 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:35,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 09:47:35,557 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:35,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:35,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1304559468, now seen corresponding path program 1 times [2025-03-03 09:47:35,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:35,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447314232] [2025-03-03 09:47:35,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:47:35,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:35,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-03 09:47:35,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 09:47:35,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:47:35,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 1388 trivial. 0 not checked. [2025-03-03 09:47:36,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:36,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447314232] [2025-03-03 09:47:36,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447314232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:47:36,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:47:36,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 09:47:36,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147430534] [2025-03-03 09:47:36,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:47:36,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:47:36,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:36,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:47:36,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:47:36,249 INFO L87 Difference]: Start difference. First operand 15762 states and 23611 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:36,811 INFO L93 Difference]: Finished difference Result 76123 states and 114339 transitions. [2025-03-03 09:47:36,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:47:36,812 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-03-03 09:47:36,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:36,878 INFO L225 Difference]: With dead ends: 76123 [2025-03-03 09:47:36,878 INFO L226 Difference]: Without dead ends: 60946 [2025-03-03 09:47:36,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:47:36,907 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 578 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:36,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1832 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:47:36,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60946 states. [2025-03-03 09:47:37,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60946 to 18258. [2025-03-03 09:47:37,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18258 states, 18168 states have (on average 1.4702223690004403) internal successors, (26711), 18180 states have internal predecessors, (26711), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 09:47:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18258 states to 18258 states and 26875 transitions. [2025-03-03 09:47:37,266 INFO L78 Accepts]: Start accepts. Automaton has 18258 states and 26875 transitions. Word has length 499 [2025-03-03 09:47:37,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:37,266 INFO L471 AbstractCegarLoop]: Abstraction has 18258 states and 26875 transitions. [2025-03-03 09:47:37,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:37,267 INFO L276 IsEmpty]: Start isEmpty. Operand 18258 states and 26875 transitions. [2025-03-03 09:47:37,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-03 09:47:37,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:37,283 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:37,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 09:47:37,283 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:37,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:37,283 INFO L85 PathProgramCache]: Analyzing trace with hash 766973061, now seen corresponding path program 1 times [2025-03-03 09:47:37,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:37,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163887743] [2025-03-03 09:47:37,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:47:37,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:37,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-03 09:47:37,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 09:47:37,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:47:37,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 1314 trivial. 0 not checked. [2025-03-03 09:47:38,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:38,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163887743] [2025-03-03 09:47:38,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163887743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:47:38,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:47:38,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 09:47:38,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298769065] [2025-03-03 09:47:38,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:47:38,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:47:38,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:38,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:47:38,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:47:38,057 INFO L87 Difference]: Start difference. First operand 18258 states and 26875 transitions. Second operand has 8 states, 8 states have (on average 23.0) internal successors, (184), 8 states have internal predecessors, (184), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:38,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:38,572 INFO L93 Difference]: Finished difference Result 78619 states and 117219 transitions. [2025-03-03 09:47:38,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:47:38,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.0) internal successors, (184), 8 states have internal predecessors, (184), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-03-03 09:47:38,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:38,631 INFO L225 Difference]: With dead ends: 78619 [2025-03-03 09:47:38,631 INFO L226 Difference]: Without dead ends: 60946 [2025-03-03 09:47:38,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:47:38,660 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 381 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:38,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 2151 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:47:38,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60946 states. [2025-03-03 09:47:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60946 to 22098. [2025-03-03 09:47:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22098 states, 22008 states have (on average 1.4579698291530352) internal successors, (32087), 22020 states have internal predecessors, (32087), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 09:47:38,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22098 states to 22098 states and 32251 transitions. [2025-03-03 09:47:38,989 INFO L78 Accepts]: Start accepts. Automaton has 22098 states and 32251 transitions. Word has length 499 [2025-03-03 09:47:38,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:38,989 INFO L471 AbstractCegarLoop]: Abstraction has 22098 states and 32251 transitions. [2025-03-03 09:47:38,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.0) internal successors, (184), 8 states have internal predecessors, (184), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:38,990 INFO L276 IsEmpty]: Start isEmpty. Operand 22098 states and 32251 transitions. [2025-03-03 09:47:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-03 09:47:39,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:39,008 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:39,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 09:47:39,008 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:39,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:39,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1728504032, now seen corresponding path program 1 times [2025-03-03 09:47:39,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:39,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521520861] [2025-03-03 09:47:39,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:47:39,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:39,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-03 09:47:39,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 09:47:39,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:47:39,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 1307 trivial. 0 not checked. [2025-03-03 09:47:39,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:39,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521520861] [2025-03-03 09:47:39,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521520861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:47:39,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:47:39,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:47:39,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71619262] [2025-03-03 09:47:39,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:47:39,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:47:39,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:39,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:47:39,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:39,548 INFO L87 Difference]: Start difference. First operand 22098 states and 32251 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:39,641 INFO L93 Difference]: Finished difference Result 44187 states and 64519 transitions. [2025-03-03 09:47:39,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:47:39,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-03-03 09:47:39,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:39,662 INFO L225 Difference]: With dead ends: 44187 [2025-03-03 09:47:39,662 INFO L226 Difference]: Without dead ends: 22674 [2025-03-03 09:47:39,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:39,681 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:39,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1025 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:47:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22674 states. [2025-03-03 09:47:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22674 to 22482. [2025-03-03 09:47:39,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22482 states, 22392 states have (on average 1.4501161128974633) internal successors, (32471), 22404 states have internal predecessors, (32471), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 09:47:39,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22482 states to 22482 states and 32635 transitions. [2025-03-03 09:47:39,877 INFO L78 Accepts]: Start accepts. Automaton has 22482 states and 32635 transitions. Word has length 499 [2025-03-03 09:47:39,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:39,877 INFO L471 AbstractCegarLoop]: Abstraction has 22482 states and 32635 transitions. [2025-03-03 09:47:39,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 22482 states and 32635 transitions. [2025-03-03 09:47:39,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-03 09:47:39,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:39,896 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:39,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 09:47:39,896 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:39,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:39,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1425799173, now seen corresponding path program 1 times [2025-03-03 09:47:39,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:39,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758506913] [2025-03-03 09:47:39,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:47:39,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:40,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-03 09:47:40,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 09:47:40,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:47:40,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:40,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2025-03-03 09:47:40,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:40,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758506913] [2025-03-03 09:47:40,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758506913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:47:40,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:47:40,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:47:40,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807290598] [2025-03-03 09:47:40,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:47:40,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:47:40,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:40,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:47:40,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:40,273 INFO L87 Difference]: Start difference. First operand 22482 states and 32635 transitions. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:40,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:40,364 INFO L93 Difference]: Finished difference Result 44955 states and 65287 transitions. [2025-03-03 09:47:40,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:47:40,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-03-03 09:47:40,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:40,385 INFO L225 Difference]: With dead ends: 44955 [2025-03-03 09:47:40,385 INFO L226 Difference]: Without dead ends: 23058 [2025-03-03 09:47:40,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:40,402 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:40,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1025 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:47:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23058 states. [2025-03-03 09:47:40,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23058 to 22866. [2025-03-03 09:47:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22866 states, 22776 states have (on average 1.4425272216368106) internal successors, (32855), 22788 states have internal predecessors, (32855), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 09:47:40,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22866 states to 22866 states and 33019 transitions. [2025-03-03 09:47:40,598 INFO L78 Accepts]: Start accepts. Automaton has 22866 states and 33019 transitions. Word has length 499 [2025-03-03 09:47:40,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:40,598 INFO L471 AbstractCegarLoop]: Abstraction has 22866 states and 33019 transitions. [2025-03-03 09:47:40,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:40,599 INFO L276 IsEmpty]: Start isEmpty. Operand 22866 states and 33019 transitions. [2025-03-03 09:47:40,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-03 09:47:40,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:40,618 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:40,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 09:47:40,618 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:40,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1533794394, now seen corresponding path program 1 times [2025-03-03 09:47:40,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:40,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870142401] [2025-03-03 09:47:40,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:47:40,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:40,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-03 09:47:40,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 09:47:40,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:47:40,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2025-03-03 09:47:40,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:40,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870142401] [2025-03-03 09:47:40,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870142401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:47:40,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:47:40,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:47:40,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080887053] [2025-03-03 09:47:40,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:47:40,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:47:40,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:40,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:47:40,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:40,964 INFO L87 Difference]: Start difference. First operand 22866 states and 33019 transitions. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:41,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:41,130 INFO L93 Difference]: Finished difference Result 45723 states and 66247 transitions. [2025-03-03 09:47:41,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:47:41,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-03-03 09:47:41,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:41,149 INFO L225 Difference]: With dead ends: 45723 [2025-03-03 09:47:41,149 INFO L226 Difference]: Without dead ends: 23442 [2025-03-03 09:47:41,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:41,159 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:41,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1027 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:47:41,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23442 states. [2025-03-03 09:47:41,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23442 to 23442. [2025-03-03 09:47:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23442 states, 23352 states have (on average 1.4316118533744433) internal successors, (33431), 23364 states have internal predecessors, (33431), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 09:47:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23442 states to 23442 states and 33595 transitions. [2025-03-03 09:47:41,454 INFO L78 Accepts]: Start accepts. Automaton has 23442 states and 33595 transitions. Word has length 499 [2025-03-03 09:47:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:41,454 INFO L471 AbstractCegarLoop]: Abstraction has 23442 states and 33595 transitions. [2025-03-03 09:47:41,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 23442 states and 33595 transitions. [2025-03-03 09:47:41,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-03 09:47:41,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:41,483 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:41,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 09:47:41,483 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:41,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:41,483 INFO L85 PathProgramCache]: Analyzing trace with hash -188191621, now seen corresponding path program 1 times [2025-03-03 09:47:41,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:41,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569198232] [2025-03-03 09:47:41,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:47:41,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:41,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-03 09:47:41,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 09:47:41,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:47:41,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 1268 trivial. 0 not checked. [2025-03-03 09:47:42,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:42,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569198232] [2025-03-03 09:47:42,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569198232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:47:42,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:47:42,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 09:47:42,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625219727] [2025-03-03 09:47:42,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:47:42,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:47:42,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:42,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:47:42,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:47:42,298 INFO L87 Difference]: Start difference. First operand 23442 states and 33595 transitions. Second operand has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:42,810 INFO L93 Difference]: Finished difference Result 88411 states and 127779 transitions. [2025-03-03 09:47:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:47:42,810 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-03-03 09:47:42,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:42,875 INFO L225 Difference]: With dead ends: 88411 [2025-03-03 09:47:42,875 INFO L226 Difference]: Without dead ends: 65554 [2025-03-03 09:47:42,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:47:42,908 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 347 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 2161 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:42,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 2161 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:47:42,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65554 states. [2025-03-03 09:47:43,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65554 to 26514. [2025-03-03 09:47:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26514 states, 26424 states have (on average 1.4322963972146534) internal successors, (37847), 26436 states have internal predecessors, (37847), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 09:47:43,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26514 states to 26514 states and 38011 transitions. [2025-03-03 09:47:43,388 INFO L78 Accepts]: Start accepts. Automaton has 26514 states and 38011 transitions. Word has length 499 [2025-03-03 09:47:43,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:43,388 INFO L471 AbstractCegarLoop]: Abstraction has 26514 states and 38011 transitions. [2025-03-03 09:47:43,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 26514 states and 38011 transitions. [2025-03-03 09:47:43,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-03 09:47:43,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:43,412 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:43,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 09:47:43,413 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:43,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1223269208, now seen corresponding path program 1 times [2025-03-03 09:47:43,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:43,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025415416] [2025-03-03 09:47:43,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:47:43,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:43,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-03 09:47:43,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 09:47:43,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:47:43,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2025-03-03 09:47:43,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:43,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025415416] [2025-03-03 09:47:43,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025415416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:47:43,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:47:43,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:47:43,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902645830] [2025-03-03 09:47:43,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:47:43,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:47:43,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:43,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:47:43,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:43,746 INFO L87 Difference]: Start difference. First operand 26514 states and 38011 transitions. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:43,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:43,857 INFO L93 Difference]: Finished difference Result 53019 states and 76039 transitions. [2025-03-03 09:47:43,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:47:43,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-03-03 09:47:43,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:43,882 INFO L225 Difference]: With dead ends: 53019 [2025-03-03 09:47:43,883 INFO L226 Difference]: Without dead ends: 27090 [2025-03-03 09:47:43,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:43,904 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:43,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1025 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:47:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27090 states. [2025-03-03 09:47:44,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27090 to 26898. [2025-03-03 09:47:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26898 states, 26808 states have (on average 1.4261041480155177) internal successors, (38231), 26820 states have internal predecessors, (38231), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 09:47:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26898 states to 26898 states and 38395 transitions. [2025-03-03 09:47:44,150 INFO L78 Accepts]: Start accepts. Automaton has 26898 states and 38395 transitions. Word has length 499 [2025-03-03 09:47:44,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:44,150 INFO L471 AbstractCegarLoop]: Abstraction has 26898 states and 38395 transitions. [2025-03-03 09:47:44,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 26898 states and 38395 transitions. [2025-03-03 09:47:44,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-03 09:47:44,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:44,174 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:44,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 09:47:44,174 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:44,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:44,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1381162357, now seen corresponding path program 1 times [2025-03-03 09:47:44,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:44,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454063920] [2025-03-03 09:47:44,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:47:44,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:44,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-03 09:47:44,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 09:47:44,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:47:44,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:44,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 1261 trivial. 0 not checked. [2025-03-03 09:47:44,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:44,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454063920] [2025-03-03 09:47:44,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454063920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:47:44,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:47:44,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:47:44,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146229175] [2025-03-03 09:47:44,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:47:44,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:47:44,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:44,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:47:44,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:44,500 INFO L87 Difference]: Start difference. First operand 26898 states and 38395 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:44,657 INFO L93 Difference]: Finished difference Result 53787 states and 76999 transitions. [2025-03-03 09:47:44,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:47:44,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-03-03 09:47:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:44,682 INFO L225 Difference]: With dead ends: 53787 [2025-03-03 09:47:44,682 INFO L226 Difference]: Without dead ends: 27474 [2025-03-03 09:47:44,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:44,703 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:44,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1027 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:47:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27474 states. [2025-03-03 09:47:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27474 to 27474. [2025-03-03 09:47:44,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27474 states, 27384 states have (on average 1.417141396435875) internal successors, (38807), 27396 states have internal predecessors, (38807), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 09:47:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27474 states to 27474 states and 38971 transitions. [2025-03-03 09:47:44,942 INFO L78 Accepts]: Start accepts. Automaton has 27474 states and 38971 transitions. Word has length 499 [2025-03-03 09:47:44,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:44,942 INFO L471 AbstractCegarLoop]: Abstraction has 27474 states and 38971 transitions. [2025-03-03 09:47:44,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 27474 states and 38971 transitions. [2025-03-03 09:47:44,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-03 09:47:44,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:44,967 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:44,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 09:47:44,968 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:44,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:44,968 INFO L85 PathProgramCache]: Analyzing trace with hash 202803127, now seen corresponding path program 1 times [2025-03-03 09:47:44,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:44,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894261592] [2025-03-03 09:47:44,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:47:44,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:45,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-03 09:47:45,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 09:47:45,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:47:45,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:45,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 1131 trivial. 0 not checked. [2025-03-03 09:47:45,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:45,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894261592] [2025-03-03 09:47:45,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894261592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:47:45,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:47:45,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:47:45,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525493983] [2025-03-03 09:47:45,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:47:45,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:47:45,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:45,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:47:45,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:45,306 INFO L87 Difference]: Start difference. First operand 27474 states and 38971 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:45,418 INFO L93 Difference]: Finished difference Result 54555 states and 77383 transitions. [2025-03-03 09:47:45,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:47:45,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-03-03 09:47:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:45,448 INFO L225 Difference]: With dead ends: 54555 [2025-03-03 09:47:45,448 INFO L226 Difference]: Without dead ends: 27666 [2025-03-03 09:47:45,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:45,471 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 0 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:45,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1030 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:47:45,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27666 states. [2025-03-03 09:47:45,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27666 to 27474. [2025-03-03 09:47:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27474 states, 27384 states have (on average 1.4101300029214139) internal successors, (38615), 27396 states have internal predecessors, (38615), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 09:47:45,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27474 states to 27474 states and 38779 transitions. [2025-03-03 09:47:45,726 INFO L78 Accepts]: Start accepts. Automaton has 27474 states and 38779 transitions. Word has length 499 [2025-03-03 09:47:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:45,727 INFO L471 AbstractCegarLoop]: Abstraction has 27474 states and 38779 transitions. [2025-03-03 09:47:45,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:45,727 INFO L276 IsEmpty]: Start isEmpty. Operand 27474 states and 38779 transitions. [2025-03-03 09:47:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-03 09:47:45,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:45,751 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:45,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 09:47:45,751 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:45,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:45,751 INFO L85 PathProgramCache]: Analyzing trace with hash 964684438, now seen corresponding path program 1 times [2025-03-03 09:47:45,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:45,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320052876] [2025-03-03 09:47:45,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:47:45,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:45,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-03 09:47:46,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 09:47:46,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:47:46,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 1133 trivial. 0 not checked. [2025-03-03 09:47:46,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:46,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320052876] [2025-03-03 09:47:46,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320052876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:47:46,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:47:46,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:47:46,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179521381] [2025-03-03 09:47:46,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:47:46,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:47:46,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:46,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:47:46,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:46,143 INFO L87 Difference]: Start difference. First operand 27474 states and 38779 transitions. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:46,255 INFO L93 Difference]: Finished difference Result 54939 states and 77575 transitions. [2025-03-03 09:47:46,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:47:46,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-03-03 09:47:46,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:46,287 INFO L225 Difference]: With dead ends: 54939 [2025-03-03 09:47:46,287 INFO L226 Difference]: Without dead ends: 28050 [2025-03-03 09:47:46,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:46,311 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 0 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:46,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1030 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:47:46,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28050 states. [2025-03-03 09:47:46,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28050 to 27858. [2025-03-03 09:47:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27858 states, 27768 states have (on average 1.3975439354652839) internal successors, (38807), 27780 states have internal predecessors, (38807), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 09:47:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27858 states to 27858 states and 38971 transitions. [2025-03-03 09:47:46,570 INFO L78 Accepts]: Start accepts. Automaton has 27858 states and 38971 transitions. Word has length 499 [2025-03-03 09:47:46,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:46,570 INFO L471 AbstractCegarLoop]: Abstraction has 27858 states and 38971 transitions. [2025-03-03 09:47:46,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:46,571 INFO L276 IsEmpty]: Start isEmpty. Operand 27858 states and 38971 transitions. [2025-03-03 09:47:46,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-03 09:47:46,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:46,596 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:46,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 09:47:46,596 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:46,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:46,596 INFO L85 PathProgramCache]: Analyzing trace with hash 290617653, now seen corresponding path program 1 times [2025-03-03 09:47:46,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:46,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643995073] [2025-03-03 09:47:46,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:47:46,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:46,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-03 09:47:46,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 09:47:46,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:47:46,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 1135 trivial. 0 not checked. [2025-03-03 09:47:46,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:46,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643995073] [2025-03-03 09:47:46,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643995073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:47:46,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:47:46,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:47:46,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455477824] [2025-03-03 09:47:46,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:47:46,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:47:46,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:46,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:47:46,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:46,926 INFO L87 Difference]: Start difference. First operand 27858 states and 38971 transitions. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:47,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:47,041 INFO L93 Difference]: Finished difference Result 55707 states and 78151 transitions. [2025-03-03 09:47:47,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:47:47,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-03-03 09:47:47,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:47,071 INFO L225 Difference]: With dead ends: 55707 [2025-03-03 09:47:47,071 INFO L226 Difference]: Without dead ends: 28434 [2025-03-03 09:47:47,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:47,094 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 0 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:47,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1031 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:47:47,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28434 states. [2025-03-03 09:47:47,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28434 to 28434. [2025-03-03 09:47:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28434 states, 28344 states have (on average 1.3759173017217048) internal successors, (38999), 28356 states have internal predecessors, (38999), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-03 09:47:47,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28434 states to 28434 states and 39163 transitions. [2025-03-03 09:47:47,350 INFO L78 Accepts]: Start accepts. Automaton has 28434 states and 39163 transitions. Word has length 499 [2025-03-03 09:47:47,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:47:47,350 INFO L471 AbstractCegarLoop]: Abstraction has 28434 states and 39163 transitions. [2025-03-03 09:47:47,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:47,350 INFO L276 IsEmpty]: Start isEmpty. Operand 28434 states and 39163 transitions. [2025-03-03 09:47:47,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-03 09:47:47,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:47:47,442 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:47:47,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 09:47:47,442 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:47:47,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:47:47,443 INFO L85 PathProgramCache]: Analyzing trace with hash 526787476, now seen corresponding path program 1 times [2025-03-03 09:47:47,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:47:47,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507792886] [2025-03-03 09:47:47,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:47:47,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:47:47,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-03 09:47:47,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 09:47:47,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:47:47,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:47:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1459 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2025-03-03 09:47:47,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:47:47,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507792886] [2025-03-03 09:47:47,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507792886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:47:47,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:47:47,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:47:47,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039680775] [2025-03-03 09:47:47,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:47:47,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:47:47,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:47:47,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:47:47,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:47,956 INFO L87 Difference]: Start difference. First operand 28434 states and 39163 transitions. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 09:47:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:47:48,112 INFO L93 Difference]: Finished difference Result 56475 states and 77767 transitions. [2025-03-03 09:47:48,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:47:48,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 499 [2025-03-03 09:47:48,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:47:48,146 INFO L225 Difference]: With dead ends: 56475 [2025-03-03 09:47:48,146 INFO L226 Difference]: Without dead ends: 28626 [2025-03-03 09:47:48,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:47:48,176 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:47:48,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1027 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:47:48,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28626 states. [2025-03-03 09:47:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28626 to 28626. [2025-03-03 09:47:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28626 states, 28536 states have (on average 1.3599313148303898) internal successors, (38807), 28548 states have internal predecessors, (38807), 82 states have call successors, (82), 7 states have call predecessors, (82), 7 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82)