./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:17:33,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:17:33,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 06:17:33,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:17:33,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:17:33,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:17:33,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:17:33,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:17:33,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 06:17:33,930 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 06:17:33,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:17:33,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:17:33,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:17:33,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:17:33,931 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:17:33,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:17:33,932 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:17:33,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:17:33,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:17:33,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:17:33,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:17:33,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:17:33,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:17:33,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:17:33,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:17:33,933 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2025-03-04 06:17:34,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:17:34,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:17:34,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:17:34,159 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:17:34,159 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:17:34,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i [2025-03-04 06:17:35,291 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4be176524/df133a76d51f4b2d92b4889a7d6d4794/FLAG04010abcb [2025-03-04 06:17:35,593 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:17:35,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i [2025-03-04 06:17:35,613 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4be176524/df133a76d51f4b2d92b4889a7d6d4794/FLAG04010abcb [2025-03-04 06:17:35,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4be176524/df133a76d51f4b2d92b4889a7d6d4794 [2025-03-04 06:17:35,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:17:35,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:17:35,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:17:35,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:17:35,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:17:35,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:17:35" (1/1) ... [2025-03-04 06:17:35,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a374779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:35, skipping insertion in model container [2025-03-04 06:17:35,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:17:35" (1/1) ... [2025-03-04 06:17:35,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:17:36,102 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/uthash-2.0.2/uthash_SFH_nondet_test3-1.i[33519,33532] [2025-03-04 06:17:36,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:17:36,199 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:17:36,233 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/uthash-2.0.2/uthash_SFH_nondet_test3-1.i[33519,33532] [2025-03-04 06:17:36,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:17:36,325 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:17:36,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:36 WrapperNode [2025-03-04 06:17:36,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:17:36,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:17:36,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:17:36,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:17:36,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:36" (1/1) ... [2025-03-04 06:17:36,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:36" (1/1) ... [2025-03-04 06:17:36,395 INFO L138 Inliner]: procedures = 177, calls = 273, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1386 [2025-03-04 06:17:36,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:17:36,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:17:36,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:17:36,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:17:36,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:36" (1/1) ... [2025-03-04 06:17:36,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:36" (1/1) ... [2025-03-04 06:17:36,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:36" (1/1) ... [2025-03-04 06:17:36,483 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [34, 2, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 54 writes are split as follows [4, 0, 50]. [2025-03-04 06:17:36,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:36" (1/1) ... [2025-03-04 06:17:36,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:36" (1/1) ... [2025-03-04 06:17:36,505 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:36" (1/1) ... [2025-03-04 06:17:36,507 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:36" (1/1) ... [2025-03-04 06:17:36,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:36" (1/1) ... [2025-03-04 06:17:36,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:36" (1/1) ... [2025-03-04 06:17:36,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:17:36,526 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:17:36,526 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:17:36,526 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:17:36,528 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:36" (1/1) ... [2025-03-04 06:17:36,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:17:36,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:17:36,555 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-04 06:17:36,560 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-04 06:17:36,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 06:17:36,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 06:17:36,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 06:17:36,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 06:17:36,577 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 06:17:36,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 06:17:36,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 06:17:36,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 06:17:36,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 06:17:36,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 06:17:36,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 06:17:36,578 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 06:17:36,578 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 06:17:36,578 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 06:17:36,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:17:36,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:17:36,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 06:17:36,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 06:17:36,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 06:17:36,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:17:36,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 06:17:36,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 06:17:36,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 06:17:36,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:17:36,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 06:17:36,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 06:17:36,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 06:17:36,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:17:36,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:17:36,749 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:17:36,751 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:17:37,776 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 06:17:37,849 INFO L? ?]: Removed 313 outVars from TransFormulas that were not future-live. [2025-03-04 06:17:37,850 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:17:37,905 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:17:37,905 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 06:17:37,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:17:37 BoogieIcfgContainer [2025-03-04 06:17:37,905 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:17:37,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:17:37,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:17:37,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:17:37,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:17:35" (1/3) ... [2025-03-04 06:17:37,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c2fe47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:17:37, skipping insertion in model container [2025-03-04 06:17:37,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:17:36" (2/3) ... [2025-03-04 06:17:37,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c2fe47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:17:37, skipping insertion in model container [2025-03-04 06:17:37,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:17:37" (3/3) ... [2025-03-04 06:17:37,912 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test3-1.i [2025-03-04 06:17:37,925 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:17:37,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_nondet_test3-1.i that has 5 procedures, 403 locations, 1 initial locations, 36 loop locations, and 1 error locations. [2025-03-04 06:17:37,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:17:37,993 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;@4ff617f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:17:37,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 06:17:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 395 states, 386 states have (on average 1.6191709844559585) internal successors, (625), 388 states have internal predecessors, (625), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 06:17:38,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 06:17:38,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:38,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:17:38,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:38,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:38,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1168373514, now seen corresponding path program 1 times [2025-03-04 06:17:38,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:38,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902524692] [2025-03-04 06:17:38,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:38,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:38,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 06:17:38,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 06:17:38,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:38,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:17:38,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:38,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902524692] [2025-03-04 06:17:38,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902524692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:38,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:38,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:17:38,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824172035] [2025-03-04 06:17:38,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:38,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:17:38,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:38,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:17:38,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:17:38,171 INFO L87 Difference]: Start difference. First operand has 395 states, 386 states have (on average 1.6191709844559585) internal successors, (625), 388 states have internal predecessors, (625), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:17:38,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:38,288 INFO L93 Difference]: Finished difference Result 787 states and 1268 transitions. [2025-03-04 06:17:38,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:17:38,290 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 06:17:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:38,299 INFO L225 Difference]: With dead ends: 787 [2025-03-04 06:17:38,300 INFO L226 Difference]: Without dead ends: 392 [2025-03-04 06:17:38,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:17:38,309 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:38,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 530 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:17:38,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-04 06:17:38,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-04 06:17:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.453125) internal successors, (558), 385 states have internal predecessors, (558), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 06:17:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 568 transitions. [2025-03-04 06:17:38,362 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 568 transitions. Word has length 12 [2025-03-04 06:17:38,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:38,362 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 568 transitions. [2025-03-04 06:17:38,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:17:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 568 transitions. [2025-03-04 06:17:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 06:17:38,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:38,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:17:38,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:17:38,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:38,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:38,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2052111927, now seen corresponding path program 1 times [2025-03-04 06:17:38,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:38,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317973598] [2025-03-04 06:17:38,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:38,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:38,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 06:17:38,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 06:17:38,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:38,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:17:38,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:38,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317973598] [2025-03-04 06:17:38,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317973598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:38,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:38,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:17:38,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716816629] [2025-03-04 06:17:38,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:38,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:17:38,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:38,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:17:38,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:17:38,523 INFO L87 Difference]: Start difference. First operand 392 states and 568 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:17:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:38,924 INFO L93 Difference]: Finished difference Result 1073 states and 1573 transitions. [2025-03-04 06:17:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:17:38,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 06:17:38,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:38,928 INFO L225 Difference]: With dead ends: 1073 [2025-03-04 06:17:38,928 INFO L226 Difference]: Without dead ends: 682 [2025-03-04 06:17:38,929 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-04 06:17:38,930 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 426 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:38,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1498 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:17:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-04 06:17:38,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 681. [2025-03-04 06:17:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 672 states have (on average 1.4732142857142858) internal successors, (990), 674 states have internal predecessors, (990), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 06:17:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1002 transitions. [2025-03-04 06:17:38,965 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1002 transitions. Word has length 14 [2025-03-04 06:17:38,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:38,965 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1002 transitions. [2025-03-04 06:17:38,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:17:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1002 transitions. [2025-03-04 06:17:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 06:17:38,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:38,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:17:38,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:17:38,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:38,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:38,972 INFO L85 PathProgramCache]: Analyzing trace with hash 905864474, now seen corresponding path program 1 times [2025-03-04 06:17:38,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:38,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412321948] [2025-03-04 06:17:38,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:38,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:38,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:17:39,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:17:39,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:39,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:17:39,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:39,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412321948] [2025-03-04 06:17:39,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412321948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:39,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:39,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:17:39,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265938159] [2025-03-04 06:17:39,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:39,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:17:39,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:39,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:17:39,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:17:39,219 INFO L87 Difference]: Start difference. First operand 681 states and 1002 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:17:39,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:39,364 INFO L93 Difference]: Finished difference Result 948 states and 1387 transitions. [2025-03-04 06:17:39,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:17:39,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-04 06:17:39,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:39,367 INFO L225 Difference]: With dead ends: 948 [2025-03-04 06:17:39,369 INFO L226 Difference]: Without dead ends: 597 [2025-03-04 06:17:39,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:17:39,371 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 30 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:39,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1283 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:17:39,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-04 06:17:39,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2025-03-04 06:17:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 588 states have (on average 1.4217687074829932) internal successors, (836), 590 states have internal predecessors, (836), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 06:17:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 848 transitions. [2025-03-04 06:17:39,402 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 848 transitions. Word has length 66 [2025-03-04 06:17:39,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:39,402 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 848 transitions. [2025-03-04 06:17:39,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:17:39,402 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 848 transitions. [2025-03-04 06:17:39,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 06:17:39,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:39,404 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:17:39,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:17:39,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:39,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:39,404 INFO L85 PathProgramCache]: Analyzing trace with hash 620657441, now seen corresponding path program 1 times [2025-03-04 06:17:39,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:39,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960685117] [2025-03-04 06:17:39,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:39,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:39,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:17:39,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:17:39,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:39,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:17:39,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:39,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960685117] [2025-03-04 06:17:39,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960685117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:39,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:39,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:17:39,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712847346] [2025-03-04 06:17:39,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:39,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:17:39,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:39,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:17:39,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:17:39,775 INFO L87 Difference]: Start difference. First operand 597 states and 848 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:17:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:40,050 INFO L93 Difference]: Finished difference Result 1103 states and 1536 transitions. [2025-03-04 06:17:40,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:17:40,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-04 06:17:40,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:40,054 INFO L225 Difference]: With dead ends: 1103 [2025-03-04 06:17:40,054 INFO L226 Difference]: Without dead ends: 833 [2025-03-04 06:17:40,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:17:40,055 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 459 mSDsluCounter, 2275 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 2754 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:40,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 2754 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:17:40,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-04 06:17:40,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 596. [2025-03-04 06:17:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 587 states have (on average 1.4207836456558773) internal successors, (834), 589 states have internal predecessors, (834), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 06:17:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 846 transitions. [2025-03-04 06:17:40,086 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 846 transitions. Word has length 66 [2025-03-04 06:17:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:40,086 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 846 transitions. [2025-03-04 06:17:40,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:17:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 846 transitions. [2025-03-04 06:17:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 06:17:40,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:40,091 INFO L218 NwaCegarLoop]: trace histogram [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-04 06:17:40,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:17:40,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:40,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:40,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1089864033, now seen corresponding path program 1 times [2025-03-04 06:17:40,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:40,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705378219] [2025-03-04 06:17:40,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:40,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:40,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 06:17:40,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 06:17:40,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:40,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:40,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:17:40,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:40,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705378219] [2025-03-04 06:17:40,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705378219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:40,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:40,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:17:40,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642839769] [2025-03-04 06:17:40,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:40,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:17:40,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:40,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:17:40,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:17:40,324 INFO L87 Difference]: Start difference. First operand 596 states and 846 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:40,430 INFO L93 Difference]: Finished difference Result 1139 states and 1610 transitions. [2025-03-04 06:17:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:17:40,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-03-04 06:17:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:40,432 INFO L225 Difference]: With dead ends: 1139 [2025-03-04 06:17:40,432 INFO L226 Difference]: Without dead ends: 602 [2025-03-04 06:17:40,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:17:40,435 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 105 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:40,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1191 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:17:40,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-04 06:17:40,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 596. [2025-03-04 06:17:40,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 587 states have (on average 1.3969335604770017) internal successors, (820), 589 states have internal predecessors, (820), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 06:17:40,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 832 transitions. [2025-03-04 06:17:40,448 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 832 transitions. Word has length 103 [2025-03-04 06:17:40,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:40,448 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 832 transitions. [2025-03-04 06:17:40,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:40,448 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 832 transitions. [2025-03-04 06:17:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 06:17:40,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:40,449 INFO L218 NwaCegarLoop]: trace histogram [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-04 06:17:40,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:17:40,449 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:40,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:40,450 INFO L85 PathProgramCache]: Analyzing trace with hash -867177305, now seen corresponding path program 1 times [2025-03-04 06:17:40,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:40,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014143380] [2025-03-04 06:17:40,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:40,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:40,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 06:17:40,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 06:17:40,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:40,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:17:40,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:40,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014143380] [2025-03-04 06:17:40,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014143380] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:17:40,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675858927] [2025-03-04 06:17:40,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:40,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:17:40,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:17:40,852 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-04 06:17:40,854 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-04 06:17:40,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 06:17:41,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 06:17:41,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:41,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:41,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 06:17:41,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:17:41,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:17:41,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-03-04 06:17:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:17:41,726 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:17:41,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675858927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:41,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:17:41,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 06:17:41,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224346330] [2025-03-04 06:17:41,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:41,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:17:41,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:41,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:17:41,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:17:41,728 INFO L87 Difference]: Start difference. First operand 596 states and 832 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:44,232 INFO L93 Difference]: Finished difference Result 1392 states and 1929 transitions. [2025-03-04 06:17:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 06:17:44,232 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-03-04 06:17:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:44,235 INFO L225 Difference]: With dead ends: 1392 [2025-03-04 06:17:44,235 INFO L226 Difference]: Without dead ends: 881 [2025-03-04 06:17:44,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-04 06:17:44,236 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 723 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 2863 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:44,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 2863 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 06:17:44,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-04 06:17:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 621. [2025-03-04 06:17:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 612 states have (on average 1.3888888888888888) internal successors, (850), 614 states have internal predecessors, (850), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 06:17:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 862 transitions. [2025-03-04 06:17:44,252 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 862 transitions. Word has length 103 [2025-03-04 06:17:44,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:44,252 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 862 transitions. [2025-03-04 06:17:44,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 11 states have internal predecessors, (95), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:44,253 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 862 transitions. [2025-03-04 06:17:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 06:17:44,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:44,254 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 06:17:44,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:17:44,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 06:17:44,456 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:44,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:44,456 INFO L85 PathProgramCache]: Analyzing trace with hash 152886527, now seen corresponding path program 1 times [2025-03-04 06:17:44,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:44,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67058092] [2025-03-04 06:17:44,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:44,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:44,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 06:17:44,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 06:17:44,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:44,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:17:44,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:44,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67058092] [2025-03-04 06:17:44,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67058092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:17:44,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334236708] [2025-03-04 06:17:44,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:44,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:17:44,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:17:44,830 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-04 06:17:44,832 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-04 06:17:44,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 06:17:45,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 06:17:45,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:45,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:45,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 06:17:45,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:17:45,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:17:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:17:45,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:17:45,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334236708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:45,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:17:45,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-03-04 06:17:45,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105795088] [2025-03-04 06:17:45,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:45,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:17:45,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:45,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:17:45,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:17:45,252 INFO L87 Difference]: Start difference. First operand 621 states and 862 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:45,390 INFO L93 Difference]: Finished difference Result 803 states and 1109 transitions. [2025-03-04 06:17:45,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:17:45,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-03-04 06:17:45,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:45,393 INFO L225 Difference]: With dead ends: 803 [2025-03-04 06:17:45,393 INFO L226 Difference]: Without dead ends: 793 [2025-03-04 06:17:45,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:17:45,394 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 554 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:45,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1308 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:17:45,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-03-04 06:17:45,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 623. [2025-03-04 06:17:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 614 states have (on average 1.3876221498371335) internal successors, (852), 616 states have internal predecessors, (852), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 06:17:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 864 transitions. [2025-03-04 06:17:45,408 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 864 transitions. Word has length 104 [2025-03-04 06:17:45,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:45,408 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 864 transitions. [2025-03-04 06:17:45,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:45,408 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 864 transitions. [2025-03-04 06:17:45,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 06:17:45,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:45,409 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:17:45,417 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-04 06:17:45,610 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,SelfDestructingSolverStorable6 [2025-03-04 06:17:45,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:45,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:45,610 INFO L85 PathProgramCache]: Analyzing trace with hash 264636247, now seen corresponding path program 1 times [2025-03-04 06:17:45,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:45,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820406706] [2025-03-04 06:17:45,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:45,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:45,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 06:17:45,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 06:17:45,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:45,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:17:45,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:45,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820406706] [2025-03-04 06:17:45,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820406706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:45,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:45,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:17:45,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76761358] [2025-03-04 06:17:45,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:45,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:17:45,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:45,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:17:45,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:17:45,780 INFO L87 Difference]: Start difference. First operand 623 states and 864 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:46,186 INFO L93 Difference]: Finished difference Result 1429 states and 1973 transitions. [2025-03-04 06:17:46,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:17:46,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 156 [2025-03-04 06:17:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:46,190 INFO L225 Difference]: With dead ends: 1429 [2025-03-04 06:17:46,190 INFO L226 Difference]: Without dead ends: 963 [2025-03-04 06:17:46,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:17:46,191 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 1469 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:46,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1298 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:17:46,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-04 06:17:46,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 761. [2025-03-04 06:17:46,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 751 states have (on average 1.3834886817576564) internal successors, (1039), 754 states have internal predecessors, (1039), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 06:17:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1053 transitions. [2025-03-04 06:17:46,210 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1053 transitions. Word has length 156 [2025-03-04 06:17:46,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:46,210 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1053 transitions. [2025-03-04 06:17:46,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:46,210 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1053 transitions. [2025-03-04 06:17:46,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 06:17:46,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:46,212 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:17:46,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:17:46,212 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:46,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:46,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1287913989, now seen corresponding path program 1 times [2025-03-04 06:17:46,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:46,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142528878] [2025-03-04 06:17:46,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:46,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:46,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 06:17:46,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 06:17:46,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:46,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:17:46,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:46,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142528878] [2025-03-04 06:17:46,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142528878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:17:46,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546351821] [2025-03-04 06:17:46,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:46,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:17:46,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:17:46,499 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-04 06:17:46,501 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-04 06:17:46,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 06:17:46,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 06:17:46,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:46,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:46,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 06:17:46,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:17:46,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:17:47,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:17:47,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2025-03-04 06:17:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:17:47,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:17:47,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546351821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:47,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:17:47,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-03-04 06:17:47,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356938163] [2025-03-04 06:17:47,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:47,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:17:47,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:47,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:17:47,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:17:47,261 INFO L87 Difference]: Start difference. First operand 761 states and 1053 transitions. Second operand has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:51,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 06:17:52,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:52,228 INFO L93 Difference]: Finished difference Result 1395 states and 1910 transitions. [2025-03-04 06:17:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:17:52,229 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 166 [2025-03-04 06:17:52,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:52,233 INFO L225 Difference]: With dead ends: 1395 [2025-03-04 06:17:52,233 INFO L226 Difference]: Without dead ends: 990 [2025-03-04 06:17:52,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-03-04 06:17:52,235 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 477 mSDsluCounter, 2478 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 2962 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:52,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 2962 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 723 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-03-04 06:17:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-03-04 06:17:52,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 794. [2025-03-04 06:17:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 784 states have (on average 1.3724489795918366) internal successors, (1076), 787 states have internal predecessors, (1076), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 06:17:52,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1090 transitions. [2025-03-04 06:17:52,262 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1090 transitions. Word has length 166 [2025-03-04 06:17:52,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:52,262 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1090 transitions. [2025-03-04 06:17:52,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:52,262 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1090 transitions. [2025-03-04 06:17:52,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 06:17:52,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:52,266 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:17:52,274 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-04 06:17:52,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:17:52,467 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:52,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:52,467 INFO L85 PathProgramCache]: Analyzing trace with hash -329683882, now seen corresponding path program 1 times [2025-03-04 06:17:52,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:52,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868155760] [2025-03-04 06:17:52,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:52,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:52,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 06:17:52,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 06:17:52,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:52,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:52,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:17:52,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:52,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868155760] [2025-03-04 06:17:52,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868155760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:17:52,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297150907] [2025-03-04 06:17:52,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:52,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:17:52,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:17:52,800 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-04 06:17:52,801 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-04 06:17:52,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 06:17:53,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 06:17:53,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:53,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:53,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 06:17:53,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:17:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:17:53,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:17:53,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297150907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:53,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:17:53,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 06:17:53,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789401857] [2025-03-04 06:17:53,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:53,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:17:53,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:53,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:17:53,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:17:53,405 INFO L87 Difference]: Start difference. First operand 794 states and 1090 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:53,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:53,639 INFO L93 Difference]: Finished difference Result 1521 states and 2089 transitions. [2025-03-04 06:17:53,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:17:53,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2025-03-04 06:17:53,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:53,642 INFO L225 Difference]: With dead ends: 1521 [2025-03-04 06:17:53,642 INFO L226 Difference]: Without dead ends: 837 [2025-03-04 06:17:53,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:17:53,644 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 17 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:53,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1145 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:17:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-03-04 06:17:53,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 821. [2025-03-04 06:17:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 811 states have (on average 1.3674475955610357) internal successors, (1109), 814 states have internal predecessors, (1109), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 06:17:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1123 transitions. [2025-03-04 06:17:53,663 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1123 transitions. Word has length 167 [2025-03-04 06:17:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:53,664 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1123 transitions. [2025-03-04 06:17:53,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:53,664 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1123 transitions. [2025-03-04 06:17:53,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 06:17:53,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:53,665 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:17:53,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 06:17:53,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:17:53,866 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:53,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:53,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1857344241, now seen corresponding path program 1 times [2025-03-04 06:17:53,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:53,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607415467] [2025-03-04 06:17:53,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:53,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:53,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 06:17:53,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 06:17:53,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:53,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:54,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:17:54,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:54,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607415467] [2025-03-04 06:17:54,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607415467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:54,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:54,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:17:54,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034237677] [2025-03-04 06:17:54,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:54,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:17:54,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:54,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:17:54,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:17:54,161 INFO L87 Difference]: Start difference. First operand 821 states and 1123 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:54,573 INFO L93 Difference]: Finished difference Result 1540 states and 2108 transitions. [2025-03-04 06:17:54,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:17:54,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-03-04 06:17:54,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:54,576 INFO L225 Difference]: With dead ends: 1540 [2025-03-04 06:17:54,576 INFO L226 Difference]: Without dead ends: 833 [2025-03-04 06:17:54,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:17:54,579 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 8 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:54,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1418 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:17:54,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-04 06:17:54,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 829. [2025-03-04 06:17:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 819 states have (on average 1.3663003663003663) internal successors, (1119), 822 states have internal predecessors, (1119), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 06:17:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1133 transitions. [2025-03-04 06:17:54,600 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1133 transitions. Word has length 168 [2025-03-04 06:17:54,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:54,600 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1133 transitions. [2025-03-04 06:17:54,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:54,600 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1133 transitions. [2025-03-04 06:17:54,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 06:17:54,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:54,602 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:17:54,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:17:54,602 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:54,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:54,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1869811066, now seen corresponding path program 1 times [2025-03-04 06:17:54,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:54,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834501970] [2025-03-04 06:17:54,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:54,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:54,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 06:17:54,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 06:17:54,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:54,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:17:54,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:54,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834501970] [2025-03-04 06:17:54,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834501970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:54,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:54,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:17:54,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862115302] [2025-03-04 06:17:54,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:54,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:17:54,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:54,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:17:54,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:17:54,891 INFO L87 Difference]: Start difference. First operand 829 states and 1133 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:55,432 INFO L93 Difference]: Finished difference Result 1555 states and 2128 transitions. [2025-03-04 06:17:55,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:17:55,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2025-03-04 06:17:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:55,435 INFO L225 Difference]: With dead ends: 1555 [2025-03-04 06:17:55,435 INFO L226 Difference]: Without dead ends: 851 [2025-03-04 06:17:55,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:17:55,436 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 12 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:55,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2021 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:17:55,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-03-04 06:17:55,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 845. [2025-03-04 06:17:55,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 835 states have (on average 1.3664670658682634) internal successors, (1141), 838 states have internal predecessors, (1141), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 06:17:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1155 transitions. [2025-03-04 06:17:55,456 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1155 transitions. Word has length 169 [2025-03-04 06:17:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:55,456 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1155 transitions. [2025-03-04 06:17:55,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1155 transitions. [2025-03-04 06:17:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 06:17:55,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:55,460 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:17:55,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:17:55,460 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:55,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:55,461 INFO L85 PathProgramCache]: Analyzing trace with hash 905426220, now seen corresponding path program 1 times [2025-03-04 06:17:55,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:55,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028549095] [2025-03-04 06:17:55,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:55,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:55,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 06:17:55,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 06:17:55,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:55,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:17:55,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:55,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028549095] [2025-03-04 06:17:55,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028549095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:17:55,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120606036] [2025-03-04 06:17:55,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:55,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:17:55,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:17:55,806 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-04 06:17:55,807 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-04 06:17:56,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 06:17:56,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 06:17:56,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:56,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:56,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 06:17:56,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:17:56,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:17:56,198 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:17:56,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120606036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:56,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:17:56,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2025-03-04 06:17:56,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843284710] [2025-03-04 06:17:56,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:56,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:17:56,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:56,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:17:56,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:17:56,200 INFO L87 Difference]: Start difference. First operand 845 states and 1155 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:56,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:56,543 INFO L93 Difference]: Finished difference Result 1256 states and 1716 transitions. [2025-03-04 06:17:56,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:17:56,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2025-03-04 06:17:56,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:56,546 INFO L225 Difference]: With dead ends: 1256 [2025-03-04 06:17:56,547 INFO L226 Difference]: Without dead ends: 851 [2025-03-04 06:17:56,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:17:56,548 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 34 mSDsluCounter, 1431 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:56,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1859 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:17:56,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-03-04 06:17:56,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 845. [2025-03-04 06:17:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 835 states have (on average 1.362874251497006) internal successors, (1138), 838 states have internal predecessors, (1138), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 06:17:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1152 transitions. [2025-03-04 06:17:56,568 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1152 transitions. Word has length 169 [2025-03-04 06:17:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:56,569 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1152 transitions. [2025-03-04 06:17:56,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1152 transitions. [2025-03-04 06:17:56,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 06:17:56,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:56,571 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:17:56,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 06:17:56,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 06:17:56,772 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:56,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:56,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1719563692, now seen corresponding path program 1 times [2025-03-04 06:17:56,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:56,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509789074] [2025-03-04 06:17:56,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:56,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:56,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 06:17:56,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 06:17:56,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:56,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:17:57,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:57,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509789074] [2025-03-04 06:17:57,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509789074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:57,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:57,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:17:57,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289733541] [2025-03-04 06:17:57,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:57,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:17:57,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:57,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:17:57,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:17:57,050 INFO L87 Difference]: Start difference. First operand 845 states and 1152 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:57,327 INFO L93 Difference]: Finished difference Result 1259 states and 1717 transitions. [2025-03-04 06:17:57,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:17:57,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2025-03-04 06:17:57,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:57,330 INFO L225 Difference]: With dead ends: 1259 [2025-03-04 06:17:57,330 INFO L226 Difference]: Without dead ends: 854 [2025-03-04 06:17:57,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:17:57,331 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 8 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:57,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1915 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:17:57,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2025-03-04 06:17:57,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2025-03-04 06:17:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 844 states have (on average 1.3590047393364928) internal successors, (1147), 847 states have internal predecessors, (1147), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 06:17:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1161 transitions. [2025-03-04 06:17:57,350 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1161 transitions. Word has length 170 [2025-03-04 06:17:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:57,350 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1161 transitions. [2025-03-04 06:17:57,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1161 transitions. [2025-03-04 06:17:57,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-04 06:17:57,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:57,351 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:17:57,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:17:57,352 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:57,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:57,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2133409304, now seen corresponding path program 1 times [2025-03-04 06:17:57,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:57,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532173885] [2025-03-04 06:17:57,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:57,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:57,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 06:17:57,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 06:17:57,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:57,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 06:17:57,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:57,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532173885] [2025-03-04 06:17:57,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532173885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:17:57,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:17:57,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:17:57,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641744202] [2025-03-04 06:17:57,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:17:57,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:17:57,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:17:57,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:17:57,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:17:57,603 INFO L87 Difference]: Start difference. First operand 854 states and 1161 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:17:57,953 INFO L93 Difference]: Finished difference Result 1283 states and 1744 transitions. [2025-03-04 06:17:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:17:57,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2025-03-04 06:17:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:17:57,956 INFO L225 Difference]: With dead ends: 1283 [2025-03-04 06:17:57,956 INFO L226 Difference]: Without dead ends: 869 [2025-03-04 06:17:57,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:17:57,958 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 12 mSDsluCounter, 1849 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2276 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:17:57,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2276 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:17:57,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-03-04 06:17:57,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 866. [2025-03-04 06:17:57,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 856 states have (on average 1.3574766355140186) internal successors, (1162), 859 states have internal predecessors, (1162), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 06:17:57,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1176 transitions. [2025-03-04 06:17:57,975 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1176 transitions. Word has length 171 [2025-03-04 06:17:57,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:17:57,975 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1176 transitions. [2025-03-04 06:17:57,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:17:57,976 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1176 transitions. [2025-03-04 06:17:57,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-04 06:17:57,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:17:57,977 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:17:57,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:17:57,977 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:17:57,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:17:57,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1495607235, now seen corresponding path program 1 times [2025-03-04 06:17:57,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:17:57,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539343178] [2025-03-04 06:17:57,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:57,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:17:58,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 06:17:58,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 06:17:58,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:58,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:17:58,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:17:58,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539343178] [2025-03-04 06:17:58,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539343178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:17:58,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672993872] [2025-03-04 06:17:58,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:17:58,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:17:58,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:17:58,215 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-04 06:17:58,215 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-04 06:17:58,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 06:17:58,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 06:17:58,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:17:58,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:17:58,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:17:58,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:18:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:18:10,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:18:10,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672993872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:10,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:18:10,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-04 06:18:10,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046103653] [2025-03-04 06:18:10,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:10,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:18:10,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:10,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:18:10,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:18:10,382 INFO L87 Difference]: Start difference. First operand 866 states and 1176 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:15,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 06:18:19,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 06:18:23,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 06:18:24,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 06:18:28,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 06:18:30,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 06:18:34,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 06:18:35,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 06:18:40,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 06:18:40,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:40,619 INFO L93 Difference]: Finished difference Result 1613 states and 2191 transitions. [2025-03-04 06:18:40,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:18:40,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2025-03-04 06:18:40,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:40,622 INFO L225 Difference]: With dead ends: 1613 [2025-03-04 06:18:40,622 INFO L226 Difference]: Without dead ends: 880 [2025-03-04 06:18:40,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:18:40,624 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 12 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 3 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:40,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2021 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 875 Invalid, 5 Unknown, 0 Unchecked, 30.2s Time] [2025-03-04 06:18:40,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-04 06:18:40,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 866. [2025-03-04 06:18:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 856 states have (on average 1.3574766355140186) internal successors, (1162), 859 states have internal predecessors, (1162), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 06:18:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1176 transitions. [2025-03-04 06:18:40,648 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1176 transitions. Word has length 171 [2025-03-04 06:18:40,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:40,648 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1176 transitions. [2025-03-04 06:18:40,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1176 transitions. [2025-03-04 06:18:40,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 06:18:40,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:40,649 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:18:40,661 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-04 06:18:40,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 06:18:40,851 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:40,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:40,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1964431895, now seen corresponding path program 1 times [2025-03-04 06:18:40,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:40,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305806218] [2025-03-04 06:18:40,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:40,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:40,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 06:18:40,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 06:18:40,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:40,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:18:41,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:41,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305806218] [2025-03-04 06:18:41,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305806218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:41,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:41,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 06:18:41,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247816189] [2025-03-04 06:18:41,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:41,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 06:18:41,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:41,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 06:18:41,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:18:41,212 INFO L87 Difference]: Start difference. First operand 866 states and 1176 transitions. Second operand has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:41,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:41,837 INFO L93 Difference]: Finished difference Result 1620 states and 2197 transitions. [2025-03-04 06:18:41,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:18:41,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 172 [2025-03-04 06:18:41,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:41,840 INFO L225 Difference]: With dead ends: 1620 [2025-03-04 06:18:41,840 INFO L226 Difference]: Without dead ends: 892 [2025-03-04 06:18:41,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:18:41,841 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 20 mSDsluCounter, 2045 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2472 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:41,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2472 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 06:18:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-03-04 06:18:41,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 880. [2025-03-04 06:18:41,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 870 states have (on average 1.3563218390804597) internal successors, (1180), 873 states have internal predecessors, (1180), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 06:18:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1194 transitions. [2025-03-04 06:18:41,859 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1194 transitions. Word has length 172 [2025-03-04 06:18:41,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:41,860 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1194 transitions. [2025-03-04 06:18:41,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:41,860 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1194 transitions. [2025-03-04 06:18:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 06:18:41,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:41,862 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:18:41,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:18:41,862 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:41,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1377831159, now seen corresponding path program 1 times [2025-03-04 06:18:41,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:41,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43835392] [2025-03-04 06:18:41,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:41,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:41,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 06:18:42,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 06:18:42,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:42,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:18:42,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:42,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43835392] [2025-03-04 06:18:42,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43835392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:18:42,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727335342] [2025-03-04 06:18:42,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:42,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:18:42,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:18:42,154 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-04 06:18:42,156 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-04 06:18:42,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 06:18:42,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 06:18:42,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:42,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:42,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 06:18:42,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:18:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:18:42,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:18:42,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727335342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:42,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:18:42,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-04 06:18:42,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824023172] [2025-03-04 06:18:42,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:42,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:18:42,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:42,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:18:42,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:18:42,595 INFO L87 Difference]: Start difference. First operand 880 states and 1194 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:43,126 INFO L93 Difference]: Finished difference Result 1639 states and 2226 transitions. [2025-03-04 06:18:43,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:18:43,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 172 [2025-03-04 06:18:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:43,129 INFO L225 Difference]: With dead ends: 1639 [2025-03-04 06:18:43,129 INFO L226 Difference]: Without dead ends: 904 [2025-03-04 06:18:43,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:18:43,130 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 17 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:43,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2044 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:18:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2025-03-04 06:18:43,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 894. [2025-03-04 06:18:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 884 states have (on average 1.3574660633484164) internal successors, (1200), 887 states have internal predecessors, (1200), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 06:18:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1214 transitions. [2025-03-04 06:18:43,150 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1214 transitions. Word has length 172 [2025-03-04 06:18:43,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:43,150 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1214 transitions. [2025-03-04 06:18:43,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1214 transitions. [2025-03-04 06:18:43,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 06:18:43,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:43,153 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:18:43,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 06:18:43,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:18:43,354 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:43,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:43,354 INFO L85 PathProgramCache]: Analyzing trace with hash 599050898, now seen corresponding path program 1 times [2025-03-04 06:18:43,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:43,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323568216] [2025-03-04 06:18:43,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:43,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:43,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 06:18:43,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 06:18:43,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:43,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:18:43,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:43,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323568216] [2025-03-04 06:18:43,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323568216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:43,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:18:43,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:18:43,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050923341] [2025-03-04 06:18:43,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:43,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:18:43,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:43,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:18:43,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:18:43,732 INFO L87 Difference]: Start difference. First operand 894 states and 1214 transitions. Second operand has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:44,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:44,543 INFO L93 Difference]: Finished difference Result 1659 states and 2252 transitions. [2025-03-04 06:18:44,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:18:44,544 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2025-03-04 06:18:44,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:44,546 INFO L225 Difference]: With dead ends: 1659 [2025-03-04 06:18:44,546 INFO L226 Difference]: Without dead ends: 912 [2025-03-04 06:18:44,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:18:44,549 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 26 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:44,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2712 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 06:18:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-03-04 06:18:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 900. [2025-03-04 06:18:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 890 states have (on average 1.355056179775281) internal successors, (1206), 893 states have internal predecessors, (1206), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 06:18:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1220 transitions. [2025-03-04 06:18:44,567 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1220 transitions. Word has length 173 [2025-03-04 06:18:44,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:44,567 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1220 transitions. [2025-03-04 06:18:44,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1220 transitions. [2025-03-04 06:18:44,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 06:18:44,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:44,569 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:18:44,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:18:44,569 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:44,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:44,570 INFO L85 PathProgramCache]: Analyzing trace with hash 494773472, now seen corresponding path program 1 times [2025-03-04 06:18:44,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:44,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008918367] [2025-03-04 06:18:44,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:44,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:44,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 06:18:44,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 06:18:44,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:44,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:18:44,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:44,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008918367] [2025-03-04 06:18:44,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008918367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:18:44,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370927575] [2025-03-04 06:18:44,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:44,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:18:44,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:18:44,820 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-04 06:18:44,821 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-04 06:18:45,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 06:18:45,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 06:18:45,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:45,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:45,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 06:18:45,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:18:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:18:45,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:18:45,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370927575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:45,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:18:45,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-04 06:18:45,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522445863] [2025-03-04 06:18:45,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:45,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:18:45,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:45,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:18:45,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:18:45,359 INFO L87 Difference]: Start difference. First operand 900 states and 1220 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:46,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:46,044 INFO L93 Difference]: Finished difference Result 1660 states and 2251 transitions. [2025-03-04 06:18:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:18:46,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2025-03-04 06:18:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:46,048 INFO L225 Difference]: With dead ends: 1660 [2025-03-04 06:18:46,048 INFO L226 Difference]: Without dead ends: 910 [2025-03-04 06:18:46,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 06:18:46,051 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 10 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:46,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2021 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:18:46,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-03-04 06:18:46,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 900. [2025-03-04 06:18:46,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 890 states have (on average 1.355056179775281) internal successors, (1206), 893 states have internal predecessors, (1206), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 06:18:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1220 transitions. [2025-03-04 06:18:46,071 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1220 transitions. Word has length 173 [2025-03-04 06:18:46,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:46,071 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1220 transitions. [2025-03-04 06:18:46,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:46,071 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1220 transitions. [2025-03-04 06:18:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 06:18:46,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:46,073 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:18:46,083 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-04 06:18:46,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:18:46,274 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:46,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:46,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1129990468, now seen corresponding path program 1 times [2025-03-04 06:18:46,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:46,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133254122] [2025-03-04 06:18:46,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:46,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:46,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 06:18:46,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 06:18:46,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:46,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:46,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:18:46,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:46,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133254122] [2025-03-04 06:18:46,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133254122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:18:46,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545290469] [2025-03-04 06:18:46,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:46,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:18:46,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:18:46,584 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-04 06:18:46,585 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-04 06:18:46,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 06:18:47,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 06:18:47,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:47,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:47,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 06:18:47,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:18:47,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:18:47,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:18:47,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545290469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:47,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:18:47,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2025-03-04 06:18:47,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354793517] [2025-03-04 06:18:47,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:47,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 06:18:47,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:47,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 06:18:47,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:18:47,659 INFO L87 Difference]: Start difference. First operand 900 states and 1220 transitions. Second operand has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:49,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:49,249 INFO L93 Difference]: Finished difference Result 1685 states and 2285 transitions. [2025-03-04 06:18:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 06:18:49,250 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2025-03-04 06:18:49,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:49,254 INFO L225 Difference]: With dead ends: 1685 [2025-03-04 06:18:49,254 INFO L226 Difference]: Without dead ends: 940 [2025-03-04 06:18:49,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:18:49,256 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 19 mSDsluCounter, 3418 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3833 SdHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:49,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3833 Invalid, 1960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 06:18:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2025-03-04 06:18:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 928. [2025-03-04 06:18:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 918 states have (on average 1.3529411764705883) internal successors, (1242), 921 states have internal predecessors, (1242), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 06:18:49,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1256 transitions. [2025-03-04 06:18:49,279 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1256 transitions. Word has length 173 [2025-03-04 06:18:49,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:49,279 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1256 transitions. [2025-03-04 06:18:49,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1256 transitions. [2025-03-04 06:18:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 06:18:49,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:49,281 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:18:49,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 06:18:49,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:18:49,483 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:49,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:49,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1963424306, now seen corresponding path program 1 times [2025-03-04 06:18:49,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:49,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000711134] [2025-03-04 06:18:49,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:49,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:49,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 06:18:49,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 06:18:49,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:49,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:18:49,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:49,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000711134] [2025-03-04 06:18:49,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000711134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:18:49,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181202684] [2025-03-04 06:18:49,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:49,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:18:49,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:18:49,815 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-04 06:18:49,816 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-04 06:18:50,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 06:18:50,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 06:18:50,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:50,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:50,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 06:18:50,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:18:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:18:50,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:18:50,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181202684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:50,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:18:50,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-03-04 06:18:50,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143515176] [2025-03-04 06:18:50,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:50,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:18:50,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:50,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:18:50,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:18:50,757 INFO L87 Difference]: Start difference. First operand 928 states and 1256 transitions. Second operand has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:51,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:51,514 INFO L93 Difference]: Finished difference Result 1696 states and 2295 transitions. [2025-03-04 06:18:51,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:18:51,517 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 174 [2025-03-04 06:18:51,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:51,520 INFO L225 Difference]: With dead ends: 1696 [2025-03-04 06:18:51,520 INFO L226 Difference]: Without dead ends: 942 [2025-03-04 06:18:51,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:18:51,522 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 13 mSDsluCounter, 2308 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2739 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:51,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2739 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 06:18:51,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-03-04 06:18:51,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 936. [2025-03-04 06:18:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 926 states have (on average 1.3520518358531317) internal successors, (1252), 929 states have internal predecessors, (1252), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 06:18:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1266 transitions. [2025-03-04 06:18:51,542 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1266 transitions. Word has length 174 [2025-03-04 06:18:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:51,542 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1266 transitions. [2025-03-04 06:18:51,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:51,542 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1266 transitions. [2025-03-04 06:18:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 06:18:51,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:51,544 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:18:51,555 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-04 06:18:51,744 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,SelfDestructingSolverStorable21 [2025-03-04 06:18:51,744 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:51,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:51,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1583540937, now seen corresponding path program 1 times [2025-03-04 06:18:51,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:51,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623336801] [2025-03-04 06:18:51,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:51,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:51,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 06:18:51,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 06:18:51,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:51,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:18:52,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:52,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623336801] [2025-03-04 06:18:52,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623336801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:18:52,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269330928] [2025-03-04 06:18:52,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:52,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:18:52,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:18:52,069 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-04 06:18:52,070 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-04 06:18:52,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 06:18:52,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 06:18:52,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:52,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:52,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 06:18:52,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:18:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:18:53,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:18:53,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269330928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:18:53,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:18:53,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-03-04 06:18:53,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218389596] [2025-03-04 06:18:53,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:18:53,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:18:53,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:18:53,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:18:53,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:18:53,069 INFO L87 Difference]: Start difference. First operand 936 states and 1266 transitions. Second operand has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:18:53,995 INFO L93 Difference]: Finished difference Result 1734 states and 2347 transitions. [2025-03-04 06:18:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:18:53,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 174 [2025-03-04 06:18:53,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:18:53,999 INFO L225 Difference]: With dead ends: 1734 [2025-03-04 06:18:53,999 INFO L226 Difference]: Without dead ends: 966 [2025-03-04 06:18:54,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-04 06:18:54,001 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 16 mSDsluCounter, 2596 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3023 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 06:18:54,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3023 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 06:18:54,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2025-03-04 06:18:54,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 946. [2025-03-04 06:18:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 936 states have (on average 1.3504273504273505) internal successors, (1264), 939 states have internal predecessors, (1264), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 06:18:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1278 transitions. [2025-03-04 06:18:54,027 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1278 transitions. Word has length 174 [2025-03-04 06:18:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:18:54,028 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1278 transitions. [2025-03-04 06:18:54,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:18:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1278 transitions. [2025-03-04 06:18:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 06:18:54,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:18:54,029 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:18:54,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 06:18:54,230 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,SelfDestructingSolverStorable22 [2025-03-04 06:18:54,230 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:18:54,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:18:54,231 INFO L85 PathProgramCache]: Analyzing trace with hash -855395218, now seen corresponding path program 1 times [2025-03-04 06:18:54,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:18:54,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311112797] [2025-03-04 06:18:54,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:54,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:18:54,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 06:18:54,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 06:18:54,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:54,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:18:54,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:18:54,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311112797] [2025-03-04 06:18:54,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311112797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:18:54,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720157298] [2025-03-04 06:18:54,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:18:54,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:18:54,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:18:54,505 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-04 06:18:54,507 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-04 06:18:54,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 06:18:55,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 06:18:55,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:18:55,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:18:55,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-03-04 06:18:55,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:18:55,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 06:18:55,815 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-04 06:18:55,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-04 06:18:55,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 06:18:55,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:18:55,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-04 06:18:55,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3