./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 05:58:54,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 05:58:54,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 05:58:54,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 05:58:54,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 05:58:54,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 05:58:54,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 05:58:54,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 05:58:54,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 05:58:54,791 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 05:58:54,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 05:58:54,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 05:58:54,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 05:58:54,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 05:58:54,791 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 05:58:54,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 05:58:54,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 05:58:54,792 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 05:58:54,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 05:58:54,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 05:58:54,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 05:58:54,792 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 05:58:54,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 05:58:54,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 05:58:54,792 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 05:58:54,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 05:58:54,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 05:58:54,793 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 05:58:54,793 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 05:58:54,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 05:58:54,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 05:58:54,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 05:58:54,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:58:54,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 05:58:54,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 05:58:54,793 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 05:58:54,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 05:58:54,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 05:58:54,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 05:58:54,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 05:58:54,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 05:58:54,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 05:58:54,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 05:58:54,794 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2025-03-04 05:58:55,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 05:58:55,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 05:58:55,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 05:58:55,011 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 05:58:55,011 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 05:58:55,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i [2025-03-04 05:58:56,130 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b267173c/3afbad3582c643818adf3a5408d7c546/FLAGcb76edd91 [2025-03-04 05:58:56,433 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 05:58:56,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-2.i [2025-03-04 05:58:56,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b267173c/3afbad3582c643818adf3a5408d7c546/FLAGcb76edd91 [2025-03-04 05:58:56,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b267173c/3afbad3582c643818adf3a5408d7c546 [2025-03-04 05:58:56,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 05:58:56,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 05:58:56,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 05:58:56,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 05:58:56,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 05:58:56,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:58:56" (1/1) ... [2025-03-04 05:58:56,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@811b0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:56, skipping insertion in model container [2025-03-04 05:58:56,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 05:58:56" (1/1) ... [2025-03-04 05:58:56,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 05:58:56,944 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_BER_nondet_test2-2.i[37435,37448] [2025-03-04 05:58:57,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:58:57,039 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 05:58:57,069 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_BER_nondet_test2-2.i[37435,37448] [2025-03-04 05:58:57,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 05:58:57,174 INFO L204 MainTranslator]: Completed translation [2025-03-04 05:58:57,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:57 WrapperNode [2025-03-04 05:58:57,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 05:58:57,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 05:58:57,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 05:58:57,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 05:58:57,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:57" (1/1) ... [2025-03-04 05:58:57,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:57" (1/1) ... [2025-03-04 05:58:57,271 INFO L138 Inliner]: procedures = 207, calls = 272, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1398 [2025-03-04 05:58:57,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 05:58:57,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 05:58:57,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 05:58:57,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 05:58:57,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:57" (1/1) ... [2025-03-04 05:58:57,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:57" (1/1) ... [2025-03-04 05:58:57,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:57" (1/1) ... [2025-03-04 05:58:57,357 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-04 05:58:57,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:57" (1/1) ... [2025-03-04 05:58:57,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:57" (1/1) ... [2025-03-04 05:58:57,405 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:57" (1/1) ... [2025-03-04 05:58:57,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:57" (1/1) ... [2025-03-04 05:58:57,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:57" (1/1) ... [2025-03-04 05:58:57,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:57" (1/1) ... [2025-03-04 05:58:57,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 05:58:57,432 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 05:58:57,433 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 05:58:57,433 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 05:58:57,434 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:57" (1/1) ... [2025-03-04 05:58:57,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 05:58:57,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:58:57,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 05:58:57,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 05:58:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 05:58:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 05:58:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 05:58:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 05:58:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 05:58:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 05:58:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 05:58:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 05:58:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 05:58:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 05:58:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 05:58:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 05:58:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 05:58:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 05:58:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 05:58:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 05:58:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 05:58:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 05:58:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 05:58:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 05:58:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 05:58:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 05:58:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 05:58:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 05:58:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 05:58:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 05:58:57,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 05:58:57,649 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 05:58:57,651 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 05:58:58,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 05:58:58,791 INFO L? ?]: Removed 320 outVars from TransFormulas that were not future-live. [2025-03-04 05:58:58,791 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 05:58:58,836 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 05:58:58,836 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 05:58:58,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:58:58 BoogieIcfgContainer [2025-03-04 05:58:58,837 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 05:58:58,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 05:58:58,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 05:58:58,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 05:58:58,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 05:58:56" (1/3) ... [2025-03-04 05:58:58,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d8746f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:58:58, skipping insertion in model container [2025-03-04 05:58:58,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 05:58:57" (2/3) ... [2025-03-04 05:58:58,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d8746f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 05:58:58, skipping insertion in model container [2025-03-04 05:58:58,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 05:58:58" (3/3) ... [2025-03-04 05:58:58,844 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test2-2.i [2025-03-04 05:58:58,855 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 05:58:58,856 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test2-2.i that has 4 procedures, 401 locations, 1 initial locations, 36 loop locations, and 1 error locations. [2025-03-04 05:58:58,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 05:58:58,943 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;@3734af85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 05:58:58,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 05:58:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 393 states, 387 states have (on average 1.62015503875969) internal successors, (627), 388 states have internal predecessors, (627), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:58:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 05:58:58,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:58:58,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:58:58,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:58:58,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:58:58,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2039755885, now seen corresponding path program 1 times [2025-03-04 05:58:58,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:58:58,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545165044] [2025-03-04 05:58:58,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:58,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:58:59,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 05:58:59,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 05:58:59,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:58:59,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:58:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:58:59,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:58:59,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545165044] [2025-03-04 05:58:59,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545165044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:58:59,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:58:59,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 05:58:59,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393940937] [2025-03-04 05:58:59,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:58:59,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 05:58:59,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:58:59,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 05:58:59,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 05:58:59,114 INFO L87 Difference]: Start difference. First operand has 393 states, 387 states have (on average 1.62015503875969) internal successors, (627), 388 states have internal predecessors, (627), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:58:59,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:58:59,242 INFO L93 Difference]: Finished difference Result 783 states and 1262 transitions. [2025-03-04 05:58:59,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 05:58:59,244 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 05:58:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:58:59,252 INFO L225 Difference]: With dead ends: 783 [2025-03-04 05:58:59,252 INFO L226 Difference]: Without dead ends: 356 [2025-03-04 05:58:59,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 05:58:59,258 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:58:59,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 528 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:58:59,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-04 05:58:59,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-03-04 05:58:59,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 351 states have (on average 1.4615384615384615) internal successors, (513), 351 states have internal predecessors, (513), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:58:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 519 transitions. [2025-03-04 05:58:59,298 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 519 transitions. Word has length 11 [2025-03-04 05:58:59,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:58:59,298 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 519 transitions. [2025-03-04 05:58:59,299 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:58:59,299 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 519 transitions. [2025-03-04 05:58:59,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 05:58:59,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:58:59,301 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] [2025-03-04 05:58:59,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 05:58:59,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:58:59,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:58:59,302 INFO L85 PathProgramCache]: Analyzing trace with hash 227834974, now seen corresponding path program 1 times [2025-03-04 05:58:59,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:58:59,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693994458] [2025-03-04 05:58:59,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:59,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:58:59,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 05:58:59,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 05:58:59,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:58:59,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:58:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:58:59,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:58:59,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693994458] [2025-03-04 05:58:59,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693994458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:58:59,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:58:59,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:58:59,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488275277] [2025-03-04 05:58:59,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:58:59,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:58:59,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:58:59,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:58:59,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:58:59,622 INFO L87 Difference]: Start difference. First operand 356 states and 519 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:58:59,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:58:59,759 INFO L93 Difference]: Finished difference Result 470 states and 684 transitions. [2025-03-04 05:58:59,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:58:59,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-04 05:58:59,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:58:59,761 INFO L225 Difference]: With dead ends: 470 [2025-03-04 05:58:59,761 INFO L226 Difference]: Without dead ends: 314 [2025-03-04 05:58:59,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:58:59,762 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 30 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:58:59,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1139 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:58:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-04 05:58:59,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-03-04 05:58:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:58:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 442 transitions. [2025-03-04 05:58:59,772 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 442 transitions. Word has length 64 [2025-03-04 05:58:59,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:58:59,773 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 442 transitions. [2025-03-04 05:58:59,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:58:59,773 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 442 transitions. [2025-03-04 05:58:59,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 05:58:59,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:58:59,774 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] [2025-03-04 05:58:59,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 05:58:59,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:58:59,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:58:59,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1608542245, now seen corresponding path program 1 times [2025-03-04 05:58:59,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:58:59,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579804256] [2025-03-04 05:58:59,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:58:59,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:58:59,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 05:58:59,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 05:58:59,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:58:59,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:00,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:59:00,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:00,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579804256] [2025-03-04 05:59:00,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579804256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:00,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:00,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 05:59:00,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177375095] [2025-03-04 05:59:00,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:00,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:59:00,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:00,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:59:00,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:59:00,237 INFO L87 Difference]: Start difference. First operand 314 states and 442 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:59:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:00,513 INFO L93 Difference]: Finished difference Result 737 states and 1033 transitions. [2025-03-04 05:59:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 05:59:00,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-04 05:59:00,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:00,517 INFO L225 Difference]: With dead ends: 737 [2025-03-04 05:59:00,517 INFO L226 Difference]: Without dead ends: 620 [2025-03-04 05:59:00,518 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-04 05:59:00,519 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 420 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:00,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1940 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:59:00,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-03-04 05:59:00,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 316. [2025-03-04 05:59:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 311 states have (on average 1.4083601286173633) internal successors, (438), 311 states have internal predecessors, (438), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:59:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 444 transitions. [2025-03-04 05:59:00,539 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 444 transitions. Word has length 64 [2025-03-04 05:59:00,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:00,539 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 444 transitions. [2025-03-04 05:59:00,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:59:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 444 transitions. [2025-03-04 05:59:00,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 05:59:00,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:00,546 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 05:59:00,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 05:59:00,547 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:00,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:00,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1125466816, now seen corresponding path program 1 times [2025-03-04 05:59:00,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:00,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444637341] [2025-03-04 05:59:00,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:00,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 05:59:00,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 05:59:00,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:00,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:59:00,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:00,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444637341] [2025-03-04 05:59:00,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444637341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:00,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:00,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:59:00,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673994964] [2025-03-04 05:59:00,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:00,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:59:00,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:00,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:59:00,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:59:00,835 INFO L87 Difference]: Start difference. First operand 316 states and 444 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:59:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:00,954 INFO L93 Difference]: Finished difference Result 585 states and 817 transitions. [2025-03-04 05:59:00,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:59:00,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-03-04 05:59:00,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:00,957 INFO L225 Difference]: With dead ends: 585 [2025-03-04 05:59:00,958 INFO L226 Difference]: Without dead ends: 274 [2025-03-04 05:59:00,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:59:00,959 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 30 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:00,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 917 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:59:00,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-04 05:59:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2025-03-04 05:59:00,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 269 states have (on average 1.342007434944238) internal successors, (361), 269 states have internal predecessors, (361), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:59:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 367 transitions. [2025-03-04 05:59:00,968 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 367 transitions. Word has length 138 [2025-03-04 05:59:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:00,969 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 367 transitions. [2025-03-04 05:59:00,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:59:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 367 transitions. [2025-03-04 05:59:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 05:59:00,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:00,970 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 05:59:00,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 05:59:00,971 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:00,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:00,971 INFO L85 PathProgramCache]: Analyzing trace with hash 746494522, now seen corresponding path program 1 times [2025-03-04 05:59:00,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:00,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157211532] [2025-03-04 05:59:00,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:00,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:01,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 05:59:01,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 05:59:01,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:01,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:01,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 05:59:01,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:01,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157211532] [2025-03-04 05:59:01,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157211532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:01,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:01,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 05:59:01,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680904044] [2025-03-04 05:59:01,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:01,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 05:59:01,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:01,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 05:59:01,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:01,138 INFO L87 Difference]: Start difference. First operand 274 states and 367 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:59:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:01,230 INFO L93 Difference]: Finished difference Result 721 states and 971 transitions. [2025-03-04 05:59:01,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 05:59:01,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-03-04 05:59:01,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:01,233 INFO L225 Difference]: With dead ends: 721 [2025-03-04 05:59:01,235 INFO L226 Difference]: Without dead ends: 452 [2025-03-04 05:59:01,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 05:59:01,236 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 175 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:01,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 744 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:59:01,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-04 05:59:01,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 450. [2025-03-04 05:59:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 445 states have (on average 1.348314606741573) internal successors, (600), 445 states have internal predecessors, (600), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:59:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 606 transitions. [2025-03-04 05:59:01,253 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 606 transitions. Word has length 138 [2025-03-04 05:59:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:01,254 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 606 transitions. [2025-03-04 05:59:01,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 05:59:01,254 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 606 transitions. [2025-03-04 05:59:01,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 05:59:01,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:01,256 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] [2025-03-04 05:59:01,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 05:59:01,256 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:01,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:01,256 INFO L85 PathProgramCache]: Analyzing trace with hash -873638774, now seen corresponding path program 1 times [2025-03-04 05:59:01,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:01,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625765705] [2025-03-04 05:59:01,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:01,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:01,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 05:59:01,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 05:59:01,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:01,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:59:01,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:01,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625765705] [2025-03-04 05:59:01,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625765705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:01,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:01,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 05:59:01,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93943630] [2025-03-04 05:59:01,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:01,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:59:01,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:01,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:59:01,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 05:59:01,463 INFO L87 Difference]: Start difference. First operand 450 states and 606 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:01,686 INFO L93 Difference]: Finished difference Result 719 states and 968 transitions. [2025-03-04 05:59:01,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:59:01,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 153 [2025-03-04 05:59:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:01,689 INFO L225 Difference]: With dead ends: 719 [2025-03-04 05:59:01,690 INFO L226 Difference]: Without dead ends: 359 [2025-03-04 05:59:01,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:59:01,692 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 539 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:01,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 511 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:59:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-04 05:59:01,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-04 05:59:01,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.3418079096045197) internal successors, (475), 354 states have internal predecessors, (475), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:59:01,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 481 transitions. [2025-03-04 05:59:01,707 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 481 transitions. Word has length 153 [2025-03-04 05:59:01,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:01,707 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 481 transitions. [2025-03-04 05:59:01,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 481 transitions. [2025-03-04 05:59:01,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 05:59:01,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:01,711 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] [2025-03-04 05:59:01,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 05:59:01,711 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:01,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:01,712 INFO L85 PathProgramCache]: Analyzing trace with hash -518129736, now seen corresponding path program 1 times [2025-03-04 05:59:01,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:01,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350029925] [2025-03-04 05:59:01,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:01,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:01,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 05:59:01,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 05:59:01,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:01,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:02,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:02,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350029925] [2025-03-04 05:59:02,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350029925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:02,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475078489] [2025-03-04 05:59:02,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:02,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:02,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:02,165 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:02,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 05:59:02,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 05:59:02,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 05:59:02,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:02,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:02,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 05:59:02,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:02,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 05:59:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 05:59:03,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:03,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475078489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:03,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:03,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-03-04 05:59:03,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132054361] [2025-03-04 05:59:03,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:03,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 05:59:03,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:03,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 05:59:03,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 05:59:03,127 INFO L87 Difference]: Start difference. First operand 359 states and 481 transitions. Second operand has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:03,971 INFO L93 Difference]: Finished difference Result 653 states and 871 transitions. [2025-03-04 05:59:03,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 05:59:03,972 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 163 [2025-03-04 05:59:03,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:03,975 INFO L225 Difference]: With dead ends: 653 [2025-03-04 05:59:03,975 INFO L226 Difference]: Without dead ends: 539 [2025-03-04 05:59:03,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-04 05:59:03,976 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 356 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1875 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:03,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1875 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 05:59:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-04 05:59:03,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 394. [2025-03-04 05:59:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.3213367609254498) internal successors, (514), 389 states have internal predecessors, (514), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:59:03,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 520 transitions. [2025-03-04 05:59:03,992 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 520 transitions. Word has length 163 [2025-03-04 05:59:03,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:03,992 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 520 transitions. [2025-03-04 05:59:03,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.5) internal successors, (155), 10 states have internal predecessors, (155), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:03,992 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 520 transitions. [2025-03-04 05:59:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 05:59:03,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:03,993 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] [2025-03-04 05:59:04,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 05:59:04,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:04,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:04,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:04,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1769294033, now seen corresponding path program 1 times [2025-03-04 05:59:04,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:04,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778867454] [2025-03-04 05:59:04,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:04,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:04,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 05:59:04,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 05:59:04,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:04,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:04,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:04,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:04,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778867454] [2025-03-04 05:59:04,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778867454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:04,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962235142] [2025-03-04 05:59:04,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:04,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:04,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:04,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:04,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 05:59:04,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 05:59:05,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 05:59:05,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:05,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:05,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 05:59:05,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:05,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 05:59:05,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-03-04 05:59:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:59:05,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:05,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962235142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:05,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:05,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 05:59:05,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586117587] [2025-03-04 05:59:05,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:05,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 05:59:05,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:05,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 05:59:05,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 05:59:05,565 INFO L87 Difference]: Start difference. First operand 394 states and 520 transitions. Second operand has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:06,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:06,652 INFO L93 Difference]: Finished difference Result 890 states and 1187 transitions. [2025-03-04 05:59:06,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 05:59:06,653 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 164 [2025-03-04 05:59:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:06,655 INFO L225 Difference]: With dead ends: 890 [2025-03-04 05:59:06,655 INFO L226 Difference]: Without dead ends: 539 [2025-03-04 05:59:06,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 156 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-04 05:59:06,656 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 459 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:06,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 2041 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 05:59:06,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-04 05:59:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 394. [2025-03-04 05:59:06,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.3187660668380463) internal successors, (513), 389 states have internal predecessors, (513), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:59:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 519 transitions. [2025-03-04 05:59:06,669 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 519 transitions. Word has length 164 [2025-03-04 05:59:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:06,670 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 519 transitions. [2025-03-04 05:59:06,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.272727272727273) internal successors, (157), 11 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 519 transitions. [2025-03-04 05:59:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-04 05:59:06,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:06,671 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] [2025-03-04 05:59:06,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 05:59:06,873 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,SelfDestructingSolverStorable7 [2025-03-04 05:59:06,873 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:06,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:06,874 INFO L85 PathProgramCache]: Analyzing trace with hash -966964097, now seen corresponding path program 1 times [2025-03-04 05:59:06,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:06,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911588595] [2025-03-04 05:59:06,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:06,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:06,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 05:59:07,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 05:59:07,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:07,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:07,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:07,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911588595] [2025-03-04 05:59:07,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911588595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:07,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277058528] [2025-03-04 05:59:07,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:07,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:07,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:07,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:07,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 05:59:07,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 05:59:07,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 05:59:07,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:07,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:07,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 05:59:07,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 05:59:07,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:07,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277058528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:07,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:07,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-03-04 05:59:07,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293626449] [2025-03-04 05:59:07,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:07,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 05:59:07,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:07,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 05:59:07,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:59:07,601 INFO L87 Difference]: Start difference. First operand 394 states and 519 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:07,778 INFO L93 Difference]: Finished difference Result 508 states and 672 transitions. [2025-03-04 05:59:07,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 05:59:07,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 165 [2025-03-04 05:59:07,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:07,780 INFO L225 Difference]: With dead ends: 508 [2025-03-04 05:59:07,780 INFO L226 Difference]: Without dead ends: 394 [2025-03-04 05:59:07,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:59:07,781 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 17 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:07,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1112 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:59:07,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-04 05:59:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-03-04 05:59:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 389 states have (on average 1.3161953727506426) internal successors, (512), 389 states have internal predecessors, (512), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:59:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 518 transitions. [2025-03-04 05:59:07,792 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 518 transitions. Word has length 165 [2025-03-04 05:59:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:07,793 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 518 transitions. [2025-03-04 05:59:07,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 518 transitions. [2025-03-04 05:59:07,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 05:59:07,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:07,797 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:07,806 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-04 05:59:07,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:07,998 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:07,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:07,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1778264007, now seen corresponding path program 1 times [2025-03-04 05:59:07,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:07,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799318314] [2025-03-04 05:59:08,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:08,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:08,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 05:59:08,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 05:59:08,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:08,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 05:59:08,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:08,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799318314] [2025-03-04 05:59:08,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799318314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:08,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:08,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 05:59:08,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785486471] [2025-03-04 05:59:08,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:08,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 05:59:08,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:08,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 05:59:08,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:08,364 INFO L87 Difference]: Start difference. First operand 394 states and 518 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:08,595 INFO L93 Difference]: Finished difference Result 511 states and 675 transitions. [2025-03-04 05:59:08,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 05:59:08,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 166 [2025-03-04 05:59:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:08,597 INFO L225 Difference]: With dead ends: 511 [2025-03-04 05:59:08,597 INFO L226 Difference]: Without dead ends: 397 [2025-03-04 05:59:08,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:08,598 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 8 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:08,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1335 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:59:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-04 05:59:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2025-03-04 05:59:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 392 states have (on average 1.3137755102040816) internal successors, (515), 392 states have internal predecessors, (515), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:59:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 521 transitions. [2025-03-04 05:59:08,609 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 521 transitions. Word has length 166 [2025-03-04 05:59:08,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:08,609 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 521 transitions. [2025-03-04 05:59:08,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:08,610 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 521 transitions. [2025-03-04 05:59:08,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 05:59:08,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:08,611 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:08,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 05:59:08,611 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:08,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:08,612 INFO L85 PathProgramCache]: Analyzing trace with hash -348450931, now seen corresponding path program 1 times [2025-03-04 05:59:08,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:08,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340393760] [2025-03-04 05:59:08,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:08,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:08,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 05:59:08,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 05:59:08,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:08,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:08,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:08,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340393760] [2025-03-04 05:59:08,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340393760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:08,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293253556] [2025-03-04 05:59:08,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:08,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:08,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:08,921 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:08,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 05:59:09,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 05:59:09,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 05:59:09,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:09,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:09,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 05:59:09,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:59:09,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:09,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293253556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:09,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:09,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 05:59:09,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433494423] [2025-03-04 05:59:09,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:09,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:59:09,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:09,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:59:09,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:09,254 INFO L87 Difference]: Start difference. First operand 397 states and 521 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:09,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:09,378 INFO L93 Difference]: Finished difference Result 751 states and 993 transitions. [2025-03-04 05:59:09,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:59:09,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2025-03-04 05:59:09,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:09,381 INFO L225 Difference]: With dead ends: 751 [2025-03-04 05:59:09,381 INFO L226 Difference]: Without dead ends: 397 [2025-03-04 05:59:09,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:09,383 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 17 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:09,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 842 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:59:09,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-04 05:59:09,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2025-03-04 05:59:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 392 states have (on average 1.308673469387755) internal successors, (513), 392 states have internal predecessors, (513), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:59:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 519 transitions. [2025-03-04 05:59:09,395 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 519 transitions. Word has length 167 [2025-03-04 05:59:09,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:09,395 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 519 transitions. [2025-03-04 05:59:09,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 519 transitions. [2025-03-04 05:59:09,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 05:59:09,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:09,398 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:09,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 05:59:09,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:09,599 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:09,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash -230917278, now seen corresponding path program 1 times [2025-03-04 05:59:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:09,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500428047] [2025-03-04 05:59:09,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:09,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:09,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 05:59:09,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 05:59:09,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:09,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:59:09,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:09,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500428047] [2025-03-04 05:59:09,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500428047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:09,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:09,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 05:59:09,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089976513] [2025-03-04 05:59:09,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:09,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 05:59:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:09,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 05:59:09,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:09,896 INFO L87 Difference]: Start difference. First operand 397 states and 519 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:10,098 INFO L93 Difference]: Finished difference Result 754 states and 995 transitions. [2025-03-04 05:59:10,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 05:59:10,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-03-04 05:59:10,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:10,101 INFO L225 Difference]: With dead ends: 754 [2025-03-04 05:59:10,101 INFO L226 Difference]: Without dead ends: 403 [2025-03-04 05:59:10,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 05:59:10,102 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 8 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:10,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1098 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 05:59:10,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-04 05:59:10,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-04 05:59:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 398 states have (on average 1.3040201005025125) internal successors, (519), 398 states have internal predecessors, (519), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:59:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 525 transitions. [2025-03-04 05:59:10,113 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 525 transitions. Word has length 168 [2025-03-04 05:59:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:10,114 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 525 transitions. [2025-03-04 05:59:10,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 525 transitions. [2025-03-04 05:59:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 05:59:10,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:10,116 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:10,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 05:59:10,116 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:10,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:10,117 INFO L85 PathProgramCache]: Analyzing trace with hash 51730417, now seen corresponding path program 1 times [2025-03-04 05:59:10,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:10,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733120096] [2025-03-04 05:59:10,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:10,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:10,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 05:59:10,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 05:59:10,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:10,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:10,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:59:10,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:10,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733120096] [2025-03-04 05:59:10,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733120096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:10,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:10,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 05:59:10,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045884678] [2025-03-04 05:59:10,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:10,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:59:10,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:10,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:59:10,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:59:10,396 INFO L87 Difference]: Start difference. First operand 403 states and 525 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:10,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:10,685 INFO L93 Difference]: Finished difference Result 760 states and 999 transitions. [2025-03-04 05:59:10,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 05:59:10,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2025-03-04 05:59:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:10,687 INFO L225 Difference]: With dead ends: 760 [2025-03-04 05:59:10,687 INFO L226 Difference]: Without dead ends: 413 [2025-03-04 05:59:10,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 05:59:10,688 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 12 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:10,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1574 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:59:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-04 05:59:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2025-03-04 05:59:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 406 states have (on average 1.3029556650246306) internal successors, (529), 406 states have internal predecessors, (529), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:59:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 535 transitions. [2025-03-04 05:59:10,702 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 535 transitions. Word has length 169 [2025-03-04 05:59:10,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:10,702 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 535 transitions. [2025-03-04 05:59:10,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 535 transitions. [2025-03-04 05:59:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 05:59:10,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:10,704 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:10,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 05:59:10,705 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:10,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:10,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1631611057, now seen corresponding path program 1 times [2025-03-04 05:59:10,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:10,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424638765] [2025-03-04 05:59:10,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:10,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:10,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 05:59:10,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 05:59:10,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:10,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:10,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:10,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424638765] [2025-03-04 05:59:10,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424638765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:10,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274421089] [2025-03-04 05:59:10,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:10,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:10,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:10,983 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:10,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 05:59:11,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 05:59:11,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 05:59:11,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:11,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:11,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 05:59:11,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:59:26,153 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:26,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274421089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:26,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:26,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-04 05:59:26,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713847552] [2025-03-04 05:59:26,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:26,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:59:26,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:26,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:59:26,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:59:26,155 INFO L87 Difference]: Start difference. First operand 411 states and 535 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:30,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 05:59:32,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 05:59:37,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-04 05:59:38,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:38,076 INFO L93 Difference]: Finished difference Result 772 states and 1014 transitions. [2025-03-04 05:59:38,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 05:59:38,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2025-03-04 05:59:38,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:38,078 INFO L225 Difference]: With dead ends: 772 [2025-03-04 05:59:38,078 INFO L226 Difference]: Without dead ends: 421 [2025-03-04 05:59:38,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:59:38,079 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 12 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:38,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1580 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 510 Invalid, 2 Unknown, 0 Unchecked, 11.9s Time] [2025-03-04 05:59:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-04 05:59:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 411. [2025-03-04 05:59:38,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 406 states have (on average 1.3029556650246306) internal successors, (529), 406 states have internal predecessors, (529), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:59:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 535 transitions. [2025-03-04 05:59:38,094 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 535 transitions. Word has length 169 [2025-03-04 05:59:38,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:38,094 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 535 transitions. [2025-03-04 05:59:38,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:38,094 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 535 transitions. [2025-03-04 05:59:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 05:59:38,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:38,096 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:38,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 05:59:38,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 05:59:38,301 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:38,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:38,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1093756681, now seen corresponding path program 1 times [2025-03-04 05:59:38,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:38,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229206570] [2025-03-04 05:59:38,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:38,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:38,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 05:59:38,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 05:59:38,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:38,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 05:59:38,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:38,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229206570] [2025-03-04 05:59:38,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229206570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:38,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:38,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 05:59:38,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280421084] [2025-03-04 05:59:38,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:38,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 05:59:38,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:38,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 05:59:38,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:59:38,621 INFO L87 Difference]: Start difference. First operand 411 states and 535 transitions. Second operand has 9 states, 9 states have (on average 18.11111111111111) internal successors, (163), 9 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:38,954 INFO L93 Difference]: Finished difference Result 777 states and 1018 transitions. [2025-03-04 05:59:38,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 05:59:38,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.11111111111111) internal successors, (163), 9 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2025-03-04 05:59:38,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:38,956 INFO L225 Difference]: With dead ends: 777 [2025-03-04 05:59:38,956 INFO L226 Difference]: Without dead ends: 431 [2025-03-04 05:59:38,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 05:59:38,957 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 20 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:38,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1912 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:59:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-04 05:59:38,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 425. [2025-03-04 05:59:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 420 states have (on average 1.3023809523809524) internal successors, (547), 420 states have internal predecessors, (547), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 05:59:38,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 553 transitions. [2025-03-04 05:59:38,969 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 553 transitions. Word has length 170 [2025-03-04 05:59:38,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:38,969 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 553 transitions. [2025-03-04 05:59:38,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.11111111111111) internal successors, (163), 9 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:38,970 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 553 transitions. [2025-03-04 05:59:38,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 05:59:38,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:38,971 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:38,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 05:59:38,971 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:38,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:38,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1469551031, now seen corresponding path program 1 times [2025-03-04 05:59:38,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:38,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798179093] [2025-03-04 05:59:38,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:38,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:39,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 05:59:39,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 05:59:39,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:39,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:39,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:39,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798179093] [2025-03-04 05:59:39,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798179093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:39,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181891664] [2025-03-04 05:59:39,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:39,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:39,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:39,231 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:39,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 05:59:39,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 05:59:39,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 05:59:39,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:39,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:39,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 05:59:39,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 05:59:39,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:39,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181891664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:39,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:39,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-04 05:59:39,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078638670] [2025-03-04 05:59:39,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:39,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 05:59:39,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:39,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 05:59:39,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:59:39,605 INFO L87 Difference]: Start difference. First operand 425 states and 553 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:39,675 INFO L93 Difference]: Finished difference Result 746 states and 972 transitions. [2025-03-04 05:59:39,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 05:59:39,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2025-03-04 05:59:39,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:39,678 INFO L225 Difference]: With dead ends: 746 [2025-03-04 05:59:39,678 INFO L226 Difference]: Without dead ends: 428 [2025-03-04 05:59:39,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 05:59:39,680 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 0 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:39,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 968 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 05:59:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-04 05:59:39,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-03-04 05:59:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 422 states have (on average 1.3033175355450237) internal successors, (550), 423 states have internal predecessors, (550), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 05:59:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 557 transitions. [2025-03-04 05:59:39,692 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 557 transitions. Word has length 170 [2025-03-04 05:59:39,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:39,692 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 557 transitions. [2025-03-04 05:59:39,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 557 transitions. [2025-03-04 05:59:39,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 05:59:39,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:39,694 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:39,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 05:59:39,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 05:59:39,895 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:39,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:39,895 INFO L85 PathProgramCache]: Analyzing trace with hash -312776571, now seen corresponding path program 1 times [2025-03-04 05:59:39,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:39,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399086248] [2025-03-04 05:59:39,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:39,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:39,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 05:59:40,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 05:59:40,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:40,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 05:59:40,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:40,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399086248] [2025-03-04 05:59:40,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399086248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:40,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965892540] [2025-03-04 05:59:40,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:40,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:40,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:40,188 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:40,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 05:59:40,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 05:59:40,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 05:59:40,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:40,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:40,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 05:59:40,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 05:59:40,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 05:59:40,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965892540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:40,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 05:59:40,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-04 05:59:40,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340486330] [2025-03-04 05:59:40,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:40,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 05:59:40,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:40,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 05:59:40,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 05:59:40,596 INFO L87 Difference]: Start difference. First operand 428 states and 557 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:40,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:40,877 INFO L93 Difference]: Finished difference Result 794 states and 1041 transitions. [2025-03-04 05:59:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 05:59:40,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 172 [2025-03-04 05:59:40,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:40,879 INFO L225 Difference]: With dead ends: 794 [2025-03-04 05:59:40,879 INFO L226 Difference]: Without dead ends: 438 [2025-03-04 05:59:40,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 05:59:40,880 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 17 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:40,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1584 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 05:59:40,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-04 05:59:40,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 432. [2025-03-04 05:59:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 426 states have (on average 1.300469483568075) internal successors, (554), 427 states have internal predecessors, (554), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 05:59:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 561 transitions. [2025-03-04 05:59:40,893 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 561 transitions. Word has length 172 [2025-03-04 05:59:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:40,893 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 561 transitions. [2025-03-04 05:59:40,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 561 transitions. [2025-03-04 05:59:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 05:59:40,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:40,895 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:40,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 05:59:41,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:41,100 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:41,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:41,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1860371700, now seen corresponding path program 1 times [2025-03-04 05:59:41,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:41,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557554147] [2025-03-04 05:59:41,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:41,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:41,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 05:59:41,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 05:59:41,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:41,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 05:59:41,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:41,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557554147] [2025-03-04 05:59:41,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557554147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 05:59:41,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 05:59:41,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 05:59:41,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824721532] [2025-03-04 05:59:41,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 05:59:41,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 05:59:41,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 05:59:41,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 05:59:41,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 05:59:41,447 INFO L87 Difference]: Start difference. First operand 432 states and 561 transitions. Second operand has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 05:59:41,953 INFO L93 Difference]: Finished difference Result 813 states and 1065 transitions. [2025-03-04 05:59:41,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 05:59:41,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2025-03-04 05:59:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 05:59:41,955 INFO L225 Difference]: With dead ends: 813 [2025-03-04 05:59:41,955 INFO L226 Difference]: Without dead ends: 450 [2025-03-04 05:59:41,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 05:59:41,956 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 23 mSDsluCounter, 2081 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 05:59:41,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2397 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 05:59:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-04 05:59:41,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 438. [2025-03-04 05:59:41,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 432 states have (on average 1.2962962962962963) internal successors, (560), 433 states have internal predecessors, (560), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 05:59:41,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 567 transitions. [2025-03-04 05:59:41,967 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 567 transitions. Word has length 173 [2025-03-04 05:59:41,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 05:59:41,967 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 567 transitions. [2025-03-04 05:59:41,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.5) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 05:59:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 567 transitions. [2025-03-04 05:59:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 05:59:41,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 05:59:41,968 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 05:59:41,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 05:59:41,969 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 05:59:41,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 05:59:41,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2051337904, now seen corresponding path program 1 times [2025-03-04 05:59:41,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 05:59:41,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748401783] [2025-03-04 05:59:41,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:41,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 05:59:41,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 05:59:42,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 05:59:42,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:42,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 05:59:42,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 05:59:42,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748401783] [2025-03-04 05:59:42,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748401783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 05:59:42,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169369876] [2025-03-04 05:59:42,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 05:59:42,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 05:59:42,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 05:59:42,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 05:59:42,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 05:59:42,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 05:59:42,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 05:59:42,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 05:59:42,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 05:59:42,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 123 conjuncts are in the unsatisfiable core [2025-03-04 05:59:42,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 05:59:42,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 05:59:42,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 05:59:42,981 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-04 05:59:42,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-04 05:59:42,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 05:59:43,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-04 05:59:43,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 05:59:43,204 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 05:59:43,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2025-03-04 05:59:43,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-04 05:59:47,894 INFO L224 Elim1Store]: Index analysis took 198 ms