./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_JEN_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-?-e2fb8be-m [2025-03-08 21:18:37,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:18:37,085 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 21:18:37,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:18:37,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:18:37,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:18:37,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:18:37,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:18:37,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 21:18:37,114 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 21:18:37,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:18:37,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:18:37,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:18:37,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:18:37,115 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:18:37,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:18:37,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:18:37,116 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:18:37,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:18:37,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:18:37,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:18:37,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:18:37,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:18:37,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:18:37,117 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:18:37,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:18:37,117 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:18:37,117 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:18:37,117 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:18:37,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:18:37,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 21:18:37,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:18:37,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:18:37,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:18:37,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:18:37,118 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:18:37,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:18:37,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:18:37,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:18:37,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:18:37,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:18:37,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:18:37,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:18:37,118 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-08 21:18:37,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:18:37,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:18:37,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:18:37,344 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:18:37,344 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:18:37,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test3-1.i [2025-03-08 21:18:38,505 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ef9b4382/108d02cad37646c0923913795f0602bf/FLAG38c34c50b [2025-03-08 21:18:38,770 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:18:38,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test3-1.i [2025-03-08 21:18:38,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ef9b4382/108d02cad37646c0923913795f0602bf/FLAG38c34c50b [2025-03-08 21:18:39,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ef9b4382/108d02cad37646c0923913795f0602bf [2025-03-08 21:18:39,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:18:39,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:18:39,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:18:39,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:18:39,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:18:39,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:18:39" (1/1) ... [2025-03-08 21:18:39,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f10ab80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:18:39, skipping insertion in model container [2025-03-08 21:18:39,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:18:39" (1/1) ... [2025-03-08 21:18:39,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:18:39,304 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_JEN_nondet_test3-1.i[33519,33532] [2025-03-08 21:18:39,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:18:39,397 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:18:39,423 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_JEN_nondet_test3-1.i[33519,33532] [2025-03-08 21:18:39,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:18:39,512 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:18:39,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:18:39 WrapperNode [2025-03-08 21:18:39,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:18:39,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:18:39,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:18:39,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:18:39,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:18:39" (1/1) ... [2025-03-08 21:18:39,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:18:39" (1/1) ... [2025-03-08 21:18:39,608 INFO L138 Inliner]: procedures = 177, calls = 273, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1386 [2025-03-08 21:18:39,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:18:39,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:18:39,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:18:39,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:18:39,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:18:39" (1/1) ... [2025-03-08 21:18:39,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:18:39" (1/1) ... [2025-03-08 21:18:39,629 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:18:39" (1/1) ... [2025-03-08 21:18:39,674 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2025-03-08 21:18:39,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:18:39" (1/1) ... [2025-03-08 21:18:39,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:18:39" (1/1) ... [2025-03-08 21:18:39,715 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:18:39" (1/1) ... [2025-03-08 21:18:39,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:18:39" (1/1) ... [2025-03-08 21:18:39,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:18:39" (1/1) ... [2025-03-08 21:18:39,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:18:39" (1/1) ... [2025-03-08 21:18:39,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:18:39,733 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:18:39,733 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:18:39,733 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:18:39,734 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:18:39" (1/1) ... [2025-03-08 21:18:39,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:18:39,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:18:39,757 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-08 21:18:39,760 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-08 21:18:39,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 21:18:39,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 21:18:39,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 21:18:39,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 21:18:39,779 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 21:18:39,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 21:18:39,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 21:18:39,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 21:18:39,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 21:18:39,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 21:18:39,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 21:18:39,780 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 21:18:39,780 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 21:18:39,780 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 21:18:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:18:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:18:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 21:18:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 21:18:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 21:18:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:18:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 21:18:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 21:18:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 21:18:39,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:18:39,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 21:18:39,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 21:18:39,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 21:18:39,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:18:39,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:18:39,950 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:18:39,952 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:18:41,044 INFO L1307 $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-08 21:18:41,122 INFO L? ?]: Removed 313 outVars from TransFormulas that were not future-live. [2025-03-08 21:18:41,122 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:18:41,167 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:18:41,168 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 21:18:41,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:18:41 BoogieIcfgContainer [2025-03-08 21:18:41,168 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:18:41,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:18:41,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:18:41,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:18:41,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:18:39" (1/3) ... [2025-03-08 21:18:41,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88e4574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:18:41, skipping insertion in model container [2025-03-08 21:18:41,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:18:39" (2/3) ... [2025-03-08 21:18:41,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88e4574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:18:41, skipping insertion in model container [2025-03-08 21:18:41,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:18:41" (3/3) ... [2025-03-08 21:18:41,174 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test3-1.i [2025-03-08 21:18:41,184 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:18:41,185 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test3-1.i that has 5 procedures, 403 locations, 1 initial locations, 36 loop locations, and 1 error locations. [2025-03-08 21:18:41,244 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:18:41,253 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;@d449bc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:18:41,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 21:18:41,257 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-08 21:18:41,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 21:18:41,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:18:41,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:18:41,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:18:41,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:18:41,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1168373514, now seen corresponding path program 1 times [2025-03-08 21:18:41,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:18:41,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850266844] [2025-03-08 21:18:41,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:18:41,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:18:41,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 21:18:41,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 21:18:41,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:41,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:41,396 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-08 21:18:41,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:18:41,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850266844] [2025-03-08 21:18:41,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850266844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:18:41,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:18:41,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:18:41,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534712297] [2025-03-08 21:18:41,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:18:41,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:18:41,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:18:41,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:18:41,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:18:41,426 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-08 21:18:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:18:41,542 INFO L93 Difference]: Finished difference Result 787 states and 1268 transitions. [2025-03-08 21:18:41,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:18:41,543 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-08 21:18:41,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:18:41,549 INFO L225 Difference]: With dead ends: 787 [2025-03-08 21:18:41,551 INFO L226 Difference]: Without dead ends: 392 [2025-03-08 21:18:41,556 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-08 21:18:41,558 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-08 21:18:41,559 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-08 21:18:41,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-08 21:18:41,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-08 21:18:41,599 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-08 21:18:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 568 transitions. [2025-03-08 21:18:41,608 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 568 transitions. Word has length 12 [2025-03-08 21:18:41,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:18:41,608 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 568 transitions. [2025-03-08 21:18:41,608 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-08 21:18:41,608 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 568 transitions. [2025-03-08 21:18:41,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 21:18:41,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:18:41,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:18:41,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:18:41,610 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:18:41,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:18:41,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2052111927, now seen corresponding path program 1 times [2025-03-08 21:18:41,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:18:41,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307100814] [2025-03-08 21:18:41,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:18:41,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:18:41,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 21:18:41,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 21:18:41,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:41,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:41,759 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-08 21:18:41,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:18:41,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307100814] [2025-03-08 21:18:41,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307100814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:18:41,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:18:41,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:18:41,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710793666] [2025-03-08 21:18:41,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:18:41,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:18:41,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:18:41,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:18:41,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:18:41,768 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-08 21:18:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:18:42,149 INFO L93 Difference]: Finished difference Result 1073 states and 1573 transitions. [2025-03-08 21:18:42,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:18:42,151 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-08 21:18:42,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:18:42,154 INFO L225 Difference]: With dead ends: 1073 [2025-03-08 21:18:42,156 INFO L226 Difference]: Without dead ends: 682 [2025-03-08 21:18:42,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:18:42,158 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:18:42,158 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.3s Time] [2025-03-08 21:18:42,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-08 21:18:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 681. [2025-03-08 21:18:42,181 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-08 21:18:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1002 transitions. [2025-03-08 21:18:42,183 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1002 transitions. Word has length 14 [2025-03-08 21:18:42,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:18:42,183 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1002 transitions. [2025-03-08 21:18:42,183 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-08 21:18:42,183 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1002 transitions. [2025-03-08 21:18:42,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 21:18:42,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:18:42,198 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-08 21:18:42,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:18:42,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:18:42,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:18:42,198 INFO L85 PathProgramCache]: Analyzing trace with hash 905864474, now seen corresponding path program 1 times [2025-03-08 21:18:42,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:18:42,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564702188] [2025-03-08 21:18:42,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:18:42,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:18:42,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 21:18:42,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 21:18:42,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:42,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:42,428 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-08 21:18:42,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:18:42,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564702188] [2025-03-08 21:18:42,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564702188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:18:42,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:18:42,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:18:42,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295664545] [2025-03-08 21:18:42,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:18:42,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:18:42,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:18:42,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:18:42,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:18:42,430 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-08 21:18:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:18:42,576 INFO L93 Difference]: Finished difference Result 948 states and 1387 transitions. [2025-03-08 21:18:42,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:18:42,577 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-08 21:18:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:18:42,580 INFO L225 Difference]: With dead ends: 948 [2025-03-08 21:18:42,580 INFO L226 Difference]: Without dead ends: 597 [2025-03-08 21:18:42,581 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-08 21:18:42,583 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-08 21:18:42,583 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-08 21:18:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-08 21:18:42,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2025-03-08 21:18:42,599 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-08 21:18:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 848 transitions. [2025-03-08 21:18:42,603 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 848 transitions. Word has length 66 [2025-03-08 21:18:42,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:18:42,604 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 848 transitions. [2025-03-08 21:18:42,604 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-08 21:18:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 848 transitions. [2025-03-08 21:18:42,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 21:18:42,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:18:42,607 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-08 21:18:42,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:18:42,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:18:42,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:18:42,608 INFO L85 PathProgramCache]: Analyzing trace with hash 620657441, now seen corresponding path program 1 times [2025-03-08 21:18:42,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:18:42,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437953324] [2025-03-08 21:18:42,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:18:42,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:18:42,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 21:18:42,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 21:18:42,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:42,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:43,073 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-08 21:18:43,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:18:43,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437953324] [2025-03-08 21:18:43,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437953324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:18:43,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:18:43,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 21:18:43,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550429632] [2025-03-08 21:18:43,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:18:43,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:18:43,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:18:43,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:18:43,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:18:43,076 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-08 21:18:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:18:43,384 INFO L93 Difference]: Finished difference Result 1103 states and 1536 transitions. [2025-03-08 21:18:43,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:18:43,385 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-08 21:18:43,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:18:43,388 INFO L225 Difference]: With dead ends: 1103 [2025-03-08 21:18:43,388 INFO L226 Difference]: Without dead ends: 833 [2025-03-08 21:18:43,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:18:43,389 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-08 21:18:43,389 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-08 21:18:43,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-08 21:18:43,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 596. [2025-03-08 21:18:43,405 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-08 21:18:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 846 transitions. [2025-03-08 21:18:43,407 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 846 transitions. Word has length 66 [2025-03-08 21:18:43,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:18:43,407 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 846 transitions. [2025-03-08 21:18:43,408 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-08 21:18:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 846 transitions. [2025-03-08 21:18:43,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 21:18:43,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:18:43,412 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-08 21:18:43,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:18:43,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:18:43,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:18:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1258182559, now seen corresponding path program 1 times [2025-03-08 21:18:43,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:18:43,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576266112] [2025-03-08 21:18:43,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:18:43,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:18:43,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 21:18:43,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 21:18:43,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:43,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:43,607 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-08 21:18:43,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:18:43,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576266112] [2025-03-08 21:18:43,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576266112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:18:43,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:18:43,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:18:43,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836228581] [2025-03-08 21:18:43,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:18:43,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:18:43,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:18:43,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:18:43,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:18:43,610 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-08 21:18:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:18:43,723 INFO L93 Difference]: Finished difference Result 1139 states and 1610 transitions. [2025-03-08 21:18:43,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:18:43,723 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-08 21:18:43,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:18:43,725 INFO L225 Difference]: With dead ends: 1139 [2025-03-08 21:18:43,726 INFO L226 Difference]: Without dead ends: 602 [2025-03-08 21:18:43,726 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-08 21:18:43,727 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-08 21:18:43,727 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-08 21:18:43,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-08 21:18:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 596. [2025-03-08 21:18:43,739 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-08 21:18:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 832 transitions. [2025-03-08 21:18:43,741 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 832 transitions. Word has length 103 [2025-03-08 21:18:43,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:18:43,742 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 832 transitions. [2025-03-08 21:18:43,742 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-08 21:18:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 832 transitions. [2025-03-08 21:18:43,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 21:18:43,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:18:43,744 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-08 21:18:43,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:18:43,744 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:18:43,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:18:43,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1079743399, now seen corresponding path program 1 times [2025-03-08 21:18:43,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:18:43,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294387919] [2025-03-08 21:18:43,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:18:43,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:18:43,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 21:18:43,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 21:18:43,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:43,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:44,158 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-08 21:18:44,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:18:44,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294387919] [2025-03-08 21:18:44,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294387919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:18:44,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023876430] [2025-03-08 21:18:44,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:18:44,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:18:44,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:18:44,162 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-08 21:18:44,164 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-08 21:18:44,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 21:18:44,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 21:18:44,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:44,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:44,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 21:18:44,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:18:44,426 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-08 21:18:44,451 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-08 21:18:45,081 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-08 21:18:45,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:18:45,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023876430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:18:45,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:18:45,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-08 21:18:45,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513715255] [2025-03-08 21:18:45,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:18:45,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 21:18:45,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:18:45,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 21:18:45,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:18:45,083 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-08 21:18:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:18:46,996 INFO L93 Difference]: Finished difference Result 1392 states and 1929 transitions. [2025-03-08 21:18:46,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 21:18:46,998 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-08 21:18:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:18:47,001 INFO L225 Difference]: With dead ends: 1392 [2025-03-08 21:18:47,001 INFO L226 Difference]: Without dead ends: 881 [2025-03-08 21:18:47,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-08 21:18:47,003 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 723 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 21:18:47,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 2863 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 21:18:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-08 21:18:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 621. [2025-03-08 21:18:47,016 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-08 21:18:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 862 transitions. [2025-03-08 21:18:47,018 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 862 transitions. Word has length 103 [2025-03-08 21:18:47,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:18:47,019 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 862 transitions. [2025-03-08 21:18:47,019 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-08 21:18:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 862 transitions. [2025-03-08 21:18:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 21:18:47,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:18:47,020 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-08 21:18:47,028 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-08 21:18:47,220 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-08 21:18:47,221 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:18:47,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:18:47,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2099807231, now seen corresponding path program 1 times [2025-03-08 21:18:47,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:18:47,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101593013] [2025-03-08 21:18:47,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:18:47,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:18:47,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 21:18:47,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 21:18:47,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:47,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:47,524 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-08 21:18:47,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:18:47,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101593013] [2025-03-08 21:18:47,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101593013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:18:47,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885606660] [2025-03-08 21:18:47,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:18:47,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:18:47,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:18:47,526 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-08 21:18:47,528 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-08 21:18:47,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 21:18:47,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 21:18:47,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:47,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:47,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:18:47,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:18:47,912 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-08 21:18:47,933 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-08 21:18:47,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:18:47,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885606660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:18:47,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:18:47,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-03-08 21:18:47,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498168274] [2025-03-08 21:18:47,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:18:47,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:18:47,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:18:47,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:18:47,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:18:47,935 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-08 21:18:48,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:18:48,086 INFO L93 Difference]: Finished difference Result 803 states and 1109 transitions. [2025-03-08 21:18:48,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:18:48,086 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-08 21:18:48,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:18:48,090 INFO L225 Difference]: With dead ends: 803 [2025-03-08 21:18:48,090 INFO L226 Difference]: Without dead ends: 793 [2025-03-08 21:18:48,092 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-08 21:18:48,094 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-08 21:18:48,094 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-08 21:18:48,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-03-08 21:18:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 623. [2025-03-08 21:18:48,113 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-08 21:18:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 864 transitions. [2025-03-08 21:18:48,116 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 864 transitions. Word has length 104 [2025-03-08 21:18:48,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:18:48,117 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 864 transitions. [2025-03-08 21:18:48,117 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-08 21:18:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 864 transitions. [2025-03-08 21:18:48,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 21:18:48,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:18:48,119 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-08 21:18:48,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 21:18:48,320 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-08 21:18:48,320 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:18:48,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:18:48,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1847340631, now seen corresponding path program 1 times [2025-03-08 21:18:48,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:18:48,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142434272] [2025-03-08 21:18:48,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:18:48,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:18:48,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 21:18:48,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 21:18:48,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:48,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:48,520 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-08 21:18:48,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:18:48,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142434272] [2025-03-08 21:18:48,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142434272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:18:48,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:18:48,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:18:48,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441404547] [2025-03-08 21:18:48,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:18:48,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:18:48,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:18:48,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:18:48,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:18:48,522 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-08 21:18:48,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:18:48,918 INFO L93 Difference]: Finished difference Result 1429 states and 1973 transitions. [2025-03-08 21:18:48,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:18:48,919 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-08 21:18:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:18:48,922 INFO L225 Difference]: With dead ends: 1429 [2025-03-08 21:18:48,922 INFO L226 Difference]: Without dead ends: 963 [2025-03-08 21:18:48,923 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-08 21:18:48,923 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-08 21:18:48,924 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-08 21:18:48,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-08 21:18:48,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 761. [2025-03-08 21:18:48,942 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-08 21:18:48,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1053 transitions. [2025-03-08 21:18:48,945 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1053 transitions. Word has length 156 [2025-03-08 21:18:48,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:18:48,945 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1053 transitions. [2025-03-08 21:18:48,945 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-08 21:18:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1053 transitions. [2025-03-08 21:18:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 21:18:48,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:18:48,947 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-08 21:18:48,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:18:48,947 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:18:48,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:18:48,947 INFO L85 PathProgramCache]: Analyzing trace with hash 248867077, now seen corresponding path program 1 times [2025-03-08 21:18:48,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:18:48,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392291096] [2025-03-08 21:18:48,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:18:48,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:18:48,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 21:18:49,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 21:18:49,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:49,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:49,342 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-08 21:18:49,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:18:49,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392291096] [2025-03-08 21:18:49,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392291096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:18:49,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928767743] [2025-03-08 21:18:49,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:18:49,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:18:49,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:18:49,345 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-08 21:18:49,347 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-08 21:18:49,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 21:18:49,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 21:18:49,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:49,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:49,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 21:18:49,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:18:49,664 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-08 21:18:50,119 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-08 21:18:50,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:18:50,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928767743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:18:50,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:18:50,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-03-08 21:18:50,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451271252] [2025-03-08 21:18:50,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:18:50,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:18:50,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:18:50,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:18:50,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-08 21:18:50,123 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-08 21:18:51,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:18:51,022 INFO L93 Difference]: Finished difference Result 1395 states and 1910 transitions. [2025-03-08 21:18:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:18:51,022 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-08 21:18:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:18:51,026 INFO L225 Difference]: With dead ends: 1395 [2025-03-08 21:18:51,026 INFO L226 Difference]: Without dead ends: 990 [2025-03-08 21:18:51,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-08 21:18:51,027 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 466 mSDsluCounter, 2465 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 2949 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 21:18:51,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 2949 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 21:18:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2025-03-08 21:18:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 794. [2025-03-08 21:18:51,047 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-08 21:18:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1090 transitions. [2025-03-08 21:18:51,050 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1090 transitions. Word has length 166 [2025-03-08 21:18:51,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:18:51,050 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1090 transitions. [2025-03-08 21:18:51,050 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-08 21:18:51,050 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1090 transitions. [2025-03-08 21:18:51,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 21:18:51,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:18:51,052 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-08 21:18:51,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 21:18:51,252 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-08 21:18:51,255 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:18:51,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:18:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1819600214, now seen corresponding path program 1 times [2025-03-08 21:18:51,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:18:51,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966272469] [2025-03-08 21:18:51,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:18:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:18:51,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 21:18:51,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 21:18:51,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:51,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:51,610 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-08 21:18:51,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:18:51,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966272469] [2025-03-08 21:18:51,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966272469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:18:51,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951333333] [2025-03-08 21:18:51,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:18:51,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:18:51,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:18:51,614 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-08 21:18:51,616 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-08 21:18:51,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 21:18:52,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 21:18:52,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:18:52,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:18:52,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 21:18:52,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:19:21,226 WARN L286 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 21:19:33,237 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 21:19:49,319 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 21:20:01,356 WARN L286 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 21:20:17,647 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)