./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:30:07,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:30:07,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 21:30:07,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:30:07,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:30:07,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:30:07,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:30:07,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:30:07,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 21:30:07,638 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 21:30:07,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:30:07,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:30:07,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:30:07,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:30:07,640 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:30:07,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:30:07,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:30:07,640 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:30:07,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:30:07,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:30:07,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:30:07,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:30:07,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:30:07,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:30:07,641 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:30:07,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:30:07,641 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:30:07,641 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:30:07,641 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:30:07,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:30:07,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 21:30:07,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:30:07,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:30:07,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:30:07,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:30:07,642 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:30:07,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:30:07,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:30:07,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:30:07,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:30:07,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:30:07,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:30:07,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:30:07,642 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 -> 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 [2025-03-08 21:30:07,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:30:07,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:30:07,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:30:07,878 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:30:07,878 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:30:07,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2025-03-08 21:30:08,998 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91c1d4e68/de567594f0324928973374ca5bef9e95/FLAG1a6d8987f [2025-03-08 21:30:09,312 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:30:09,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2025-03-08 21:30:09,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91c1d4e68/de567594f0324928973374ca5bef9e95/FLAG1a6d8987f [2025-03-08 21:30:09,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91c1d4e68/de567594f0324928973374ca5bef9e95 [2025-03-08 21:30:09,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:30:09,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:30:09,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:30:09,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:30:09,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:30:09,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:30:09" (1/1) ... [2025-03-08 21:30:09,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9188cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:09, skipping insertion in model container [2025-03-08 21:30:09,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:30:09" (1/1) ... [2025-03-08 21:30:09,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:30:09,918 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i[33022,33035] [2025-03-08 21:30:10,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:30:10,071 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:30:10,105 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i[33022,33035] [2025-03-08 21:30:10,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:30:10,221 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:30:10,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:10 WrapperNode [2025-03-08 21:30:10,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:30:10,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:30:10,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:30:10,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:30:10,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:10" (1/1) ... [2025-03-08 21:30:10,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:10" (1/1) ... [2025-03-08 21:30:10,337 INFO L138 Inliner]: procedures = 177, calls = 506, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3305 [2025-03-08 21:30:10,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:30:10,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:30:10,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:30:10,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:30:10,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:10" (1/1) ... [2025-03-08 21:30:10,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:10" (1/1) ... [2025-03-08 21:30:10,363 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:10" (1/1) ... [2025-03-08 21:30:10,489 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 106, 372]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 4, 82]. [2025-03-08 21:30:10,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:10" (1/1) ... [2025-03-08 21:30:10,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:10" (1/1) ... [2025-03-08 21:30:10,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:10" (1/1) ... [2025-03-08 21:30:10,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:10" (1/1) ... [2025-03-08 21:30:10,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:10" (1/1) ... [2025-03-08 21:30:10,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:10" (1/1) ... [2025-03-08 21:30:10,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:30:10,574 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:30:10,574 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:30:10,574 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:30:10,575 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:10" (1/1) ... [2025-03-08 21:30:10,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:30:10,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:30:10,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:30:10,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:30:10,626 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-03-08 21:30:10,626 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-03-08 21:30:10,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 21:30:10,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 21:30:10,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 21:30:10,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 21:30:10,626 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 21:30:10,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 21:30:10,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 21:30:10,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 21:30:10,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 21:30:10,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 21:30:10,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 21:30:10,627 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 21:30:10,627 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 21:30:10,627 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 21:30:10,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:30:10,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:30:10,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 21:30:10,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 21:30:10,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 21:30:10,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:30:10,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 21:30:10,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 21:30:10,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 21:30:10,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:30:10,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 21:30:10,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 21:30:10,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 21:30:10,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:30:10,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:30:10,846 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:30:10,848 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:30:12,802 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-08 21:30:12,981 INFO L? ?]: Removed 780 outVars from TransFormulas that were not future-live. [2025-03-08 21:30:12,981 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:30:13,059 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:30:13,059 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 21:30:13,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:30:13 BoogieIcfgContainer [2025-03-08 21:30:13,060 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:30:13,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:30:13,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:30:13,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:30:13,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:30:09" (1/3) ... [2025-03-08 21:30:13,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a7ee92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:30:13, skipping insertion in model container [2025-03-08 21:30:13,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:30:10" (2/3) ... [2025-03-08 21:30:13,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a7ee92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:30:13, skipping insertion in model container [2025-03-08 21:30:13,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:30:13" (3/3) ... [2025-03-08 21:30:13,067 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test10-1.i [2025-03-08 21:30:13,077 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:30:13,078 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test10-1.i that has 6 procedures, 1024 locations, 1 initial locations, 78 loop locations, and 1 error locations. [2025-03-08 21:30:13,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:30:13,148 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;@162d5fc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:30:13,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 21:30:13,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 1016 states, 997 states have (on average 1.6248746238716147) internal successors, (1620), 1002 states have internal predecessors, (1620), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 21:30:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 21:30:13,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:13,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:13,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:13,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:13,167 INFO L85 PathProgramCache]: Analyzing trace with hash -380536812, now seen corresponding path program 1 times [2025-03-08 21:30:13,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:13,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061116567] [2025-03-08 21:30:13,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:13,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:13,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 21:30:13,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 21:30:13,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:13,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:30:13,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:13,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061116567] [2025-03-08 21:30:13,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061116567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:13,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:13,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:30:13,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993011069] [2025-03-08 21:30:13,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:13,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:30:13,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:13,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:30:13,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:30:13,313 INFO L87 Difference]: Start difference. First operand has 1016 states, 997 states have (on average 1.6248746238716147) internal successors, (1620), 1002 states have internal predecessors, (1620), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:30:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:13,563 INFO L93 Difference]: Finished difference Result 2030 states and 3302 transitions. [2025-03-08 21:30:13,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:30:13,565 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 21:30:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:13,576 INFO L225 Difference]: With dead ends: 2030 [2025-03-08 21:30:13,577 INFO L226 Difference]: Without dead ends: 1012 [2025-03-08 21:30:13,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:30:13,587 INFO L435 NwaCegarLoop]: 1381 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:13,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1381 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:30:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2025-03-08 21:30:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2025-03-08 21:30:13,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 994 states have (on average 1.4788732394366197) internal successors, (1470), 999 states have internal predecessors, (1470), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 21:30:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1497 transitions. [2025-03-08 21:30:13,648 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1497 transitions. Word has length 13 [2025-03-08 21:30:13,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:13,648 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1497 transitions. [2025-03-08 21:30:13,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:30:13,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1497 transitions. [2025-03-08 21:30:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 21:30:13,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:13,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:13,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:30:13,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:13,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:13,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1192121012, now seen corresponding path program 1 times [2025-03-08 21:30:13,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:13,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012219347] [2025-03-08 21:30:13,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:13,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:13,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 21:30:13,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 21:30:13,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:13,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:30:14,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:14,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012219347] [2025-03-08 21:30:14,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012219347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:14,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:14,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:30:14,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53197603] [2025-03-08 21:30:14,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:14,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:30:14,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:14,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:30:14,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:30:14,084 INFO L87 Difference]: Start difference. First operand 1012 states and 1497 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:30:14,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:14,456 INFO L93 Difference]: Finished difference Result 2018 states and 2988 transitions. [2025-03-08 21:30:14,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:30:14,457 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-08 21:30:14,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:14,463 INFO L225 Difference]: With dead ends: 2018 [2025-03-08 21:30:14,463 INFO L226 Difference]: Without dead ends: 1392 [2025-03-08 21:30:14,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:30:14,465 INFO L435 NwaCegarLoop]: 1373 mSDtfsCounter, 542 mSDsluCounter, 2680 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 4053 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:14,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 4053 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:30:14,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-08 21:30:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1014. [2025-03-08 21:30:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 996 states have (on average 1.4779116465863453) internal successors, (1472), 1001 states have internal predecessors, (1472), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 21:30:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1499 transitions. [2025-03-08 21:30:14,491 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1499 transitions. Word has length 66 [2025-03-08 21:30:14,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:14,492 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1499 transitions. [2025-03-08 21:30:14,492 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:30:14,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1499 transitions. [2025-03-08 21:30:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 21:30:14,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:14,496 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, 1, 1, 1] [2025-03-08 21:30:14,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:30:14,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:14,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:14,496 INFO L85 PathProgramCache]: Analyzing trace with hash 263222360, now seen corresponding path program 1 times [2025-03-08 21:30:14,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:14,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800871048] [2025-03-08 21:30:14,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:14,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:14,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 21:30:14,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 21:30:14,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:14,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:15,035 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-08 21:30:15,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:15,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800871048] [2025-03-08 21:30:15,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800871048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:15,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:15,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:30:15,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991311063] [2025-03-08 21:30:15,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:15,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:30:15,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:15,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:30:15,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:30:15,037 INFO L87 Difference]: Start difference. First operand 1014 states and 1499 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:30:15,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:15,471 INFO L93 Difference]: Finished difference Result 2402 states and 3547 transitions. [2025-03-08 21:30:15,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:30:15,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2025-03-08 21:30:15,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:15,476 INFO L225 Difference]: With dead ends: 2402 [2025-03-08 21:30:15,476 INFO L226 Difference]: Without dead ends: 1392 [2025-03-08 21:30:15,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:30:15,478 INFO L435 NwaCegarLoop]: 1376 mSDtfsCounter, 1078 mSDsluCounter, 3987 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 5363 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:15,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 5363 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:30:15,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-08 21:30:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1017. [2025-03-08 21:30:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 999 states have (on average 1.4764764764764764) internal successors, (1475), 1004 states have internal predecessors, (1475), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 21:30:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1502 transitions. [2025-03-08 21:30:15,497 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1502 transitions. Word has length 141 [2025-03-08 21:30:15,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:15,497 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1502 transitions. [2025-03-08 21:30:15,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:30:15,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1502 transitions. [2025-03-08 21:30:15,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 21:30:15,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:15,500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:15,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:30:15,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:15,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:15,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1606050077, now seen corresponding path program 1 times [2025-03-08 21:30:15,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:15,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899330513] [2025-03-08 21:30:15,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:15,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:15,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 21:30:15,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 21:30:15,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:15,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:15,826 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-08 21:30:15,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:15,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899330513] [2025-03-08 21:30:15,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899330513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:15,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:15,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:30:15,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350125573] [2025-03-08 21:30:15,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:15,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:30:15,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:15,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:30:15,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:30:15,828 INFO L87 Difference]: Start difference. First operand 1017 states and 1502 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:30:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:16,084 INFO L93 Difference]: Finished difference Result 1985 states and 2931 transitions. [2025-03-08 21:30:16,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:30:16,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2025-03-08 21:30:16,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:16,089 INFO L225 Difference]: With dead ends: 1985 [2025-03-08 21:30:16,090 INFO L226 Difference]: Without dead ends: 975 [2025-03-08 21:30:16,091 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-08 21:30:16,094 INFO L435 NwaCegarLoop]: 1285 mSDtfsCounter, 30 mSDsluCounter, 2551 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3836 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:16,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3836 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:30:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-08 21:30:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2025-03-08 21:30:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 957 states have (on average 1.4608150470219436) internal successors, (1398), 962 states have internal predecessors, (1398), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 21:30:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1425 transitions. [2025-03-08 21:30:16,116 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1425 transitions. Word has length 210 [2025-03-08 21:30:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:16,118 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1425 transitions. [2025-03-08 21:30:16,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:30:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1425 transitions. [2025-03-08 21:30:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 21:30:16,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:16,120 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:16,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:30:16,120 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:16,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:16,121 INFO L85 PathProgramCache]: Analyzing trace with hash 802950237, now seen corresponding path program 1 times [2025-03-08 21:30:16,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:16,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827165561] [2025-03-08 21:30:16,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:16,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:16,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 21:30:16,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 21:30:16,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:16,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:16,349 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-08 21:30:16,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:16,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827165561] [2025-03-08 21:30:16,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827165561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:16,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:16,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:30:16,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579746080] [2025-03-08 21:30:16,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:16,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:30:16,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:16,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:30:16,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:30:16,353 INFO L87 Difference]: Start difference. First operand 975 states and 1425 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:30:16,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:16,641 INFO L93 Difference]: Finished difference Result 2466 states and 3618 transitions. [2025-03-08 21:30:16,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:30:16,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2025-03-08 21:30:16,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:16,649 INFO L225 Difference]: With dead ends: 2466 [2025-03-08 21:30:16,650 INFO L226 Difference]: Without dead ends: 1498 [2025-03-08 21:30:16,652 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-08 21:30:16,653 INFO L435 NwaCegarLoop]: 1301 mSDtfsCounter, 710 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:16,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2584 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:30:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2025-03-08 21:30:16,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1341. [2025-03-08 21:30:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1321 states have (on average 1.4640423921271764) internal successors, (1934), 1326 states have internal predecessors, (1934), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:30:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1965 transitions. [2025-03-08 21:30:16,695 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1965 transitions. Word has length 210 [2025-03-08 21:30:16,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:16,695 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 1965 transitions. [2025-03-08 21:30:16,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:30:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1965 transitions. [2025-03-08 21:30:16,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 21:30:16,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:16,700 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:16,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:30:16,700 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:16,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:16,701 INFO L85 PathProgramCache]: Analyzing trace with hash 11785375, now seen corresponding path program 1 times [2025-03-08 21:30:16,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:16,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999985622] [2025-03-08 21:30:16,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:16,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:16,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 21:30:16,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 21:30:16,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:16,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:30:17,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:17,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999985622] [2025-03-08 21:30:17,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999985622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:17,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:17,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:30:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056690381] [2025-03-08 21:30:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:17,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:30:17,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:17,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:30:17,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:30:17,039 INFO L87 Difference]: Start difference. First operand 1341 states and 1965 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:30:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:17,281 INFO L93 Difference]: Finished difference Result 2550 states and 3743 transitions. [2025-03-08 21:30:17,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:30:17,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 225 [2025-03-08 21:30:17,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:17,287 INFO L225 Difference]: With dead ends: 2550 [2025-03-08 21:30:17,287 INFO L226 Difference]: Without dead ends: 1299 [2025-03-08 21:30:17,290 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-08 21:30:17,290 INFO L435 NwaCegarLoop]: 1211 mSDtfsCounter, 30 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3614 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:17,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3614 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:30:17,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2025-03-08 21:30:17,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1299. [2025-03-08 21:30:17,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1279 states have (on average 1.4519155590304926) internal successors, (1857), 1284 states have internal predecessors, (1857), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 21:30:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1888 transitions. [2025-03-08 21:30:17,320 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1888 transitions. Word has length 225 [2025-03-08 21:30:17,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:17,321 INFO L471 AbstractCegarLoop]: Abstraction has 1299 states and 1888 transitions. [2025-03-08 21:30:17,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:30:17,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1888 transitions. [2025-03-08 21:30:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 21:30:17,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:17,324 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:17,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:30:17,324 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:17,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:17,325 INFO L85 PathProgramCache]: Analyzing trace with hash 876109862, now seen corresponding path program 1 times [2025-03-08 21:30:17,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:17,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418362182] [2025-03-08 21:30:17,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:17,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:17,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 21:30:17,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 21:30:17,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:17,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:30:17,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:17,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418362182] [2025-03-08 21:30:17,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418362182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:17,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:17,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:30:17,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822821490] [2025-03-08 21:30:17,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:17,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:30:17,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:17,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:30:17,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:30:17,586 INFO L87 Difference]: Start difference. First operand 1299 states and 1888 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:30:17,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:17,836 INFO L93 Difference]: Finished difference Result 3070 states and 4480 transitions. [2025-03-08 21:30:17,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:30:17,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 225 [2025-03-08 21:30:17,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:17,845 INFO L225 Difference]: With dead ends: 3070 [2025-03-08 21:30:17,845 INFO L226 Difference]: Without dead ends: 1861 [2025-03-08 21:30:17,847 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-08 21:30:17,848 INFO L435 NwaCegarLoop]: 1431 mSDtfsCounter, 591 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:17,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 2640 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:30:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2025-03-08 21:30:17,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1856. [2025-03-08 21:30:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1830 states have (on average 1.4551912568306011) internal successors, (2663), 1835 states have internal predecessors, (2663), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 21:30:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2706 transitions. [2025-03-08 21:30:17,890 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2706 transitions. Word has length 225 [2025-03-08 21:30:17,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:17,892 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 2706 transitions. [2025-03-08 21:30:17,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 21:30:17,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2706 transitions. [2025-03-08 21:30:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-08 21:30:17,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:17,895 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:17,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:30:17,895 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:17,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:17,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1836684401, now seen corresponding path program 1 times [2025-03-08 21:30:17,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:17,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206515122] [2025-03-08 21:30:17,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:17,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:17,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-08 21:30:18,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-08 21:30:18,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:18,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:18,250 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:30:18,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:18,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206515122] [2025-03-08 21:30:18,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206515122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:18,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:18,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:30:18,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257343468] [2025-03-08 21:30:18,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:18,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:30:18,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:18,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:30:18,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:30:18,253 INFO L87 Difference]: Start difference. First operand 1856 states and 2706 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 21:30:18,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:18,760 INFO L93 Difference]: Finished difference Result 3056 states and 4462 transitions. [2025-03-08 21:30:18,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:30:18,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 240 [2025-03-08 21:30:18,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:18,767 INFO L225 Difference]: With dead ends: 3056 [2025-03-08 21:30:18,768 INFO L226 Difference]: Without dead ends: 1433 [2025-03-08 21:30:18,770 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-08 21:30:18,771 INFO L435 NwaCegarLoop]: 1256 mSDtfsCounter, 2348 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2348 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:18,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2348 Valid, 1438 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:30:18,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2025-03-08 21:30:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1433. [2025-03-08 21:30:18,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1412 states have (on average 1.4405099150141643) internal successors, (2034), 1417 states have internal predecessors, (2034), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 21:30:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2067 transitions. [2025-03-08 21:30:18,807 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2067 transitions. Word has length 240 [2025-03-08 21:30:18,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:18,808 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 2067 transitions. [2025-03-08 21:30:18,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 21:30:18,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2067 transitions. [2025-03-08 21:30:18,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-08 21:30:18,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:18,812 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:18,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:30:18,813 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:18,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:18,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1656163521, now seen corresponding path program 1 times [2025-03-08 21:30:18,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:18,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026591643] [2025-03-08 21:30:18,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:18,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:18,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-08 21:30:18,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-08 21:30:18,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:18,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 21:30:19,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:19,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026591643] [2025-03-08 21:30:19,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026591643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:19,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:19,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:30:19,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776547550] [2025-03-08 21:30:19,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:19,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:30:19,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:19,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:30:19,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:30:19,099 INFO L87 Difference]: Start difference. First operand 1433 states and 2067 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:19,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:19,296 INFO L93 Difference]: Finished difference Result 2307 states and 3370 transitions. [2025-03-08 21:30:19,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:30:19,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 250 [2025-03-08 21:30:19,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:19,303 INFO L225 Difference]: With dead ends: 2307 [2025-03-08 21:30:19,303 INFO L226 Difference]: Without dead ends: 1453 [2025-03-08 21:30:19,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 21:30:19,307 INFO L435 NwaCegarLoop]: 1207 mSDtfsCounter, 8 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:19,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2399 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:30:19,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2025-03-08 21:30:19,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2025-03-08 21:30:19,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1432 states have (on average 1.4343575418994414) internal successors, (2054), 1437 states have internal predecessors, (2054), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 21:30:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2087 transitions. [2025-03-08 21:30:19,342 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2087 transitions. Word has length 250 [2025-03-08 21:30:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:19,343 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 2087 transitions. [2025-03-08 21:30:19,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2087 transitions. [2025-03-08 21:30:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-08 21:30:19,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:19,346 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:19,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:30:19,347 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:19,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:19,347 INFO L85 PathProgramCache]: Analyzing trace with hash -464123678, now seen corresponding path program 1 times [2025-03-08 21:30:19,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:19,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246615395] [2025-03-08 21:30:19,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:19,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:19,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-08 21:30:19,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-08 21:30:19,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:19,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 21:30:19,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:19,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246615395] [2025-03-08 21:30:19,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246615395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:19,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:19,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:30:19,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070676689] [2025-03-08 21:30:19,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:19,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:30:19,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:19,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:30:19,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:30:19,696 INFO L87 Difference]: Start difference. First operand 1453 states and 2087 transitions. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:19,920 INFO L93 Difference]: Finished difference Result 2317 states and 3373 transitions. [2025-03-08 21:30:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:30:19,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 250 [2025-03-08 21:30:19,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:19,926 INFO L225 Difference]: With dead ends: 2317 [2025-03-08 21:30:19,926 INFO L226 Difference]: Without dead ends: 1391 [2025-03-08 21:30:19,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:30:19,928 INFO L435 NwaCegarLoop]: 1132 mSDtfsCounter, 32 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:19,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 3382 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:30:19,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-03-08 21:30:19,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1391. [2025-03-08 21:30:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1370 states have (on average 1.4262773722627737) internal successors, (1954), 1375 states have internal predecessors, (1954), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 21:30:19,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1987 transitions. [2025-03-08 21:30:19,959 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1987 transitions. Word has length 250 [2025-03-08 21:30:19,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:19,959 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1987 transitions. [2025-03-08 21:30:19,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:19,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1987 transitions. [2025-03-08 21:30:19,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-08 21:30:19,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:19,961 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:19,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:30:19,962 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:19,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:19,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1850067397, now seen corresponding path program 1 times [2025-03-08 21:30:19,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:19,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807155767] [2025-03-08 21:30:19,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:19,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:20,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-08 21:30:20,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-08 21:30:20,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:20,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:30:20,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:20,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807155767] [2025-03-08 21:30:20,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807155767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:30:20,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906254252] [2025-03-08 21:30:20,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:20,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:30:20,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:30:20,704 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:30:20,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 21:30:21,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-08 21:30:21,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-08 21:30:21,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:21,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:21,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 21:30:21,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:30:21,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:30:21,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 21:30:21,553 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:30:21,553 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:30:21,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906254252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:21,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:30:21,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-08 21:30:21,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756294843] [2025-03-08 21:30:21,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:21,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:30:21,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:21,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:30:21,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-08 21:30:21,555 INFO L87 Difference]: Start difference. First operand 1391 states and 1987 transitions. Second operand has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:22,857 INFO L93 Difference]: Finished difference Result 2577 states and 3696 transitions. [2025-03-08 21:30:22,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:30:22,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 250 [2025-03-08 21:30:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:22,865 INFO L225 Difference]: With dead ends: 2577 [2025-03-08 21:30:22,865 INFO L226 Difference]: Without dead ends: 1710 [2025-03-08 21:30:22,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 239 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-08 21:30:22,867 INFO L435 NwaCegarLoop]: 1093 mSDtfsCounter, 1854 mSDsluCounter, 3011 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1862 SdHoareTripleChecker+Valid, 4104 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:22,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1862 Valid, 4104 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 21:30:22,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2025-03-08 21:30:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1559. [2025-03-08 21:30:22,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1528 states have (on average 1.418193717277487) internal successors, (2167), 1537 states have internal predecessors, (2167), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (23), 17 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 21:30:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2214 transitions. [2025-03-08 21:30:22,903 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2214 transitions. Word has length 250 [2025-03-08 21:30:22,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:22,904 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2214 transitions. [2025-03-08 21:30:22,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:22,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2214 transitions. [2025-03-08 21:30:22,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-08 21:30:22,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:22,907 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:22,918 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-08 21:30:23,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 21:30:23,112 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:23,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:23,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1286989784, now seen corresponding path program 1 times [2025-03-08 21:30:23,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:23,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064892308] [2025-03-08 21:30:23,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:23,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:23,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-08 21:30:23,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-08 21:30:23,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:23,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:30:24,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:24,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064892308] [2025-03-08 21:30:24,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064892308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:30:24,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090444859] [2025-03-08 21:30:24,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:24,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:30:24,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:30:24,066 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:30:24,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 21:30:24,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-08 21:30:24,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-08 21:30:24,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:24,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:24,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 1632 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:30:24,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:30:24,663 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 15 treesize of output 1 [2025-03-08 21:30:24,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:30:24,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 21:30:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:30:24,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:30:25,218 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:30:25,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090444859] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:30:25,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:30:25,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2025-03-08 21:30:25,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673730589] [2025-03-08 21:30:25,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:30:25,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 21:30:25,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:25,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 21:30:25,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-08 21:30:25,221 INFO L87 Difference]: Start difference. First operand 1559 states and 2214 transitions. Second operand has 12 states, 12 states have (on average 39.5) internal successors, (474), 12 states have internal predecessors, (474), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 21:30:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:25,996 INFO L93 Difference]: Finished difference Result 3811 states and 5365 transitions. [2025-03-08 21:30:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:30:25,996 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 39.5) internal successors, (474), 12 states have internal predecessors, (474), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 325 [2025-03-08 21:30:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:26,004 INFO L225 Difference]: With dead ends: 3811 [2025-03-08 21:30:26,004 INFO L226 Difference]: Without dead ends: 2485 [2025-03-08 21:30:26,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 639 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-03-08 21:30:26,006 INFO L435 NwaCegarLoop]: 1121 mSDtfsCounter, 1908 mSDsluCounter, 8135 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1926 SdHoareTripleChecker+Valid, 9256 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:26,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1926 Valid, 9256 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 21:30:26,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-03-08 21:30:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2203. [2025-03-08 21:30:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2203 states, 2160 states have (on average 1.3939814814814815) internal successors, (3011), 2169 states have internal predecessors, (3011), 35 states have call successors, (35), 7 states have call predecessors, (35), 7 states have return successors, (34), 28 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 21:30:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 3080 transitions. [2025-03-08 21:30:26,052 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 3080 transitions. Word has length 325 [2025-03-08 21:30:26,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:26,053 INFO L471 AbstractCegarLoop]: Abstraction has 2203 states and 3080 transitions. [2025-03-08 21:30:26,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 39.5) internal successors, (474), 12 states have internal predecessors, (474), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 21:30:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 3080 transitions. [2025-03-08 21:30:26,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-03-08 21:30:26,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:26,062 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:26,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 21:30:26,263 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,SelfDestructingSolverStorable11 [2025-03-08 21:30:26,263 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:26,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:26,264 INFO L85 PathProgramCache]: Analyzing trace with hash -485828768, now seen corresponding path program 1 times [2025-03-08 21:30:26,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:26,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349281045] [2025-03-08 21:30:26,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:26,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:26,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-08 21:30:26,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-08 21:30:26,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:26,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:30:30,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:30,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349281045] [2025-03-08 21:30:30,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349281045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:30:30,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350472444] [2025-03-08 21:30:30,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:30,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:30:30,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:30:30,369 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:30:30,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 21:30:30,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-08 21:30:31,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-08 21:30:31,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:31,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:31,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 3726 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 21:30:31,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:30:31,310 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 15 treesize of output 1 [2025-03-08 21:30:31,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:30:31,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:30:31,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:30:32,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:30:32,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 21:30:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:30:32,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:30:32,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 288 proven. 872 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:30:32,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350472444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:30:32,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:30:32,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2025-03-08 21:30:32,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709387009] [2025-03-08 21:30:32,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:30:32,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 21:30:32,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:32,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 21:30:32,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2025-03-08 21:30:32,677 INFO L87 Difference]: Start difference. First operand 2203 states and 3080 transitions. Second operand has 21 states, 21 states have (on average 64.0) internal successors, (1344), 21 states have internal predecessors, (1344), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 21:30:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:33,609 INFO L93 Difference]: Finished difference Result 5533 states and 7696 transitions. [2025-03-08 21:30:33,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 21:30:33,610 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 64.0) internal successors, (1344), 21 states have internal predecessors, (1344), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 757 [2025-03-08 21:30:33,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:33,621 INFO L225 Difference]: With dead ends: 5533 [2025-03-08 21:30:33,621 INFO L226 Difference]: Without dead ends: 4207 [2025-03-08 21:30:33,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1537 GetRequests, 1501 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=644, Unknown=0, NotChecked=0, Total=930 [2025-03-08 21:30:33,624 INFO L435 NwaCegarLoop]: 1121 mSDtfsCounter, 4895 mSDsluCounter, 8830 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4937 SdHoareTripleChecker+Valid, 9951 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:33,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4937 Valid, 9951 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 21:30:33,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4207 states. [2025-03-08 21:30:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4207 to 3925. [2025-03-08 21:30:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3925 states, 3858 states have (on average 1.371435977190254) internal successors, (5291), 3867 states have internal predecessors, (5291), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 21:30:33,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 5408 transitions. [2025-03-08 21:30:33,726 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 5408 transitions. Word has length 757 [2025-03-08 21:30:33,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:33,727 INFO L471 AbstractCegarLoop]: Abstraction has 3925 states and 5408 transitions. [2025-03-08 21:30:33,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 64.0) internal successors, (1344), 21 states have internal predecessors, (1344), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 21:30:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 5408 transitions. [2025-03-08 21:30:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2025-03-08 21:30:33,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:33,792 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:33,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 21:30:33,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:30:33,993 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:33,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:33,994 INFO L85 PathProgramCache]: Analyzing trace with hash -622598704, now seen corresponding path program 2 times [2025-03-08 21:30:33,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:33,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263625556] [2025-03-08 21:30:33,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:30:33,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:34,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1621 statements into 2 equivalence classes. [2025-03-08 21:30:34,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 76 of 1621 statements. [2025-03-08 21:30:34,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:30:34,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-08 21:30:34,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:34,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263625556] [2025-03-08 21:30:34,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263625556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:34,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:34,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 21:30:34,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727111762] [2025-03-08 21:30:34,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:34,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 21:30:34,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:34,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 21:30:34,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 21:30:34,522 INFO L87 Difference]: Start difference. First operand 3925 states and 5408 transitions. Second operand has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:35,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:35,159 INFO L93 Difference]: Finished difference Result 4782 states and 6685 transitions. [2025-03-08 21:30:35,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:30:35,159 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1621 [2025-03-08 21:30:35,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:35,170 INFO L225 Difference]: With dead ends: 4782 [2025-03-08 21:30:35,172 INFO L226 Difference]: Without dead ends: 3936 [2025-03-08 21:30:35,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 21:30:35,174 INFO L435 NwaCegarLoop]: 1138 mSDtfsCounter, 45 mSDsluCounter, 5369 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 6507 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:35,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 6507 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:30:35,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2025-03-08 21:30:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 3932. [2025-03-08 21:30:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3932 states, 3865 states have (on average 1.3707632600258732) internal successors, (5298), 3874 states have internal predecessors, (5298), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 21:30:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3932 states to 3932 states and 5415 transitions. [2025-03-08 21:30:35,245 INFO L78 Accepts]: Start accepts. Automaton has 3932 states and 5415 transitions. Word has length 1621 [2025-03-08 21:30:35,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:35,247 INFO L471 AbstractCegarLoop]: Abstraction has 3932 states and 5415 transitions. [2025-03-08 21:30:35,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 3932 states and 5415 transitions. [2025-03-08 21:30:35,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2025-03-08 21:30:35,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:35,263 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:35,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:30:35,264 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:35,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:35,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1842472832, now seen corresponding path program 1 times [2025-03-08 21:30:35,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:35,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309045408] [2025-03-08 21:30:35,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:35,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:35,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1622 statements into 1 equivalence classes. [2025-03-08 21:30:36,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1622 of 1622 statements. [2025-03-08 21:30:36,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:36,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-08 21:30:39,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:39,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309045408] [2025-03-08 21:30:39,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309045408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:39,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:39,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 21:30:39,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118265128] [2025-03-08 21:30:39,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:39,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:30:39,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:39,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:30:39,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:30:39,649 INFO L87 Difference]: Start difference. First operand 3932 states and 5415 transitions. Second operand has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:40,120 INFO L93 Difference]: Finished difference Result 4782 states and 6680 transitions. [2025-03-08 21:30:40,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:30:40,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1622 [2025-03-08 21:30:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:40,132 INFO L225 Difference]: With dead ends: 4782 [2025-03-08 21:30:40,132 INFO L226 Difference]: Without dead ends: 3937 [2025-03-08 21:30:40,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 21:30:40,134 INFO L435 NwaCegarLoop]: 1144 mSDtfsCounter, 17 mSDsluCounter, 5354 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6498 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:40,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 6498 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:30:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2025-03-08 21:30:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 3936. [2025-03-08 21:30:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3936 states, 3869 states have (on average 1.3706384078573275) internal successors, (5303), 3878 states have internal predecessors, (5303), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 21:30:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3936 states to 3936 states and 5420 transitions. [2025-03-08 21:30:40,205 INFO L78 Accepts]: Start accepts. Automaton has 3936 states and 5420 transitions. Word has length 1622 [2025-03-08 21:30:40,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:40,207 INFO L471 AbstractCegarLoop]: Abstraction has 3936 states and 5420 transitions. [2025-03-08 21:30:40,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3936 states and 5420 transitions. [2025-03-08 21:30:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1623 [2025-03-08 21:30:40,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:40,246 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:40,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:30:40,246 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:40,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:40,250 INFO L85 PathProgramCache]: Analyzing trace with hash 126922937, now seen corresponding path program 1 times [2025-03-08 21:30:40,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:40,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341234971] [2025-03-08 21:30:40,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:40,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:40,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1622 statements into 1 equivalence classes. [2025-03-08 21:30:41,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1622 of 1622 statements. [2025-03-08 21:30:41,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:41,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-08 21:30:43,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:43,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341234971] [2025-03-08 21:30:43,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341234971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:43,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:43,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 21:30:43,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093856105] [2025-03-08 21:30:43,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:43,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 21:30:43,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:43,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 21:30:43,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 21:30:43,662 INFO L87 Difference]: Start difference. First operand 3936 states and 5420 transitions. Second operand has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:44,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:44,058 INFO L93 Difference]: Finished difference Result 4780 states and 6676 transitions. [2025-03-08 21:30:44,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:30:44,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1622 [2025-03-08 21:30:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:44,067 INFO L225 Difference]: With dead ends: 4780 [2025-03-08 21:30:44,067 INFO L226 Difference]: Without dead ends: 3944 [2025-03-08 21:30:44,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:30:44,069 INFO L435 NwaCegarLoop]: 1138 mSDtfsCounter, 25 mSDsluCounter, 5399 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6537 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:44,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6537 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:30:44,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2025-03-08 21:30:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3936. [2025-03-08 21:30:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3936 states, 3869 states have (on average 1.3706384078573275) internal successors, (5303), 3878 states have internal predecessors, (5303), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 21:30:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3936 states to 3936 states and 5420 transitions. [2025-03-08 21:30:44,124 INFO L78 Accepts]: Start accepts. Automaton has 3936 states and 5420 transitions. Word has length 1622 [2025-03-08 21:30:44,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:44,125 INFO L471 AbstractCegarLoop]: Abstraction has 3936 states and 5420 transitions. [2025-03-08 21:30:44,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.75) internal successors, (238), 8 states have internal predecessors, (238), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3936 states and 5420 transitions. [2025-03-08 21:30:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1624 [2025-03-08 21:30:44,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:44,140 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:44,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:30:44,140 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:44,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:44,141 INFO L85 PathProgramCache]: Analyzing trace with hash -692160073, now seen corresponding path program 1 times [2025-03-08 21:30:44,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:44,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674834640] [2025-03-08 21:30:44,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:44,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:44,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1623 statements into 1 equivalence classes. [2025-03-08 21:30:44,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1623 of 1623 statements. [2025-03-08 21:30:44,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:44,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:47,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-08 21:30:47,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:47,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674834640] [2025-03-08 21:30:47,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674834640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:47,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:47,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:30:47,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310770401] [2025-03-08 21:30:47,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:47,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:30:47,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:47,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:30:47,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:30:47,955 INFO L87 Difference]: Start difference. First operand 3936 states and 5420 transitions. Second operand has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:48,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:48,573 INFO L93 Difference]: Finished difference Result 4788 states and 6687 transitions. [2025-03-08 21:30:48,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:30:48,574 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1623 [2025-03-08 21:30:48,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:48,583 INFO L225 Difference]: With dead ends: 4788 [2025-03-08 21:30:48,584 INFO L226 Difference]: Without dead ends: 3947 [2025-03-08 21:30:48,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 21:30:48,586 INFO L435 NwaCegarLoop]: 1141 mSDtfsCounter, 31 mSDsluCounter, 7617 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 8758 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:48,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 8758 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:30:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3947 states. [2025-03-08 21:30:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3947 to 3944. [2025-03-08 21:30:48,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3944 states, 3877 states have (on average 1.3703894763992779) internal successors, (5313), 3886 states have internal predecessors, (5313), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 21:30:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 5430 transitions. [2025-03-08 21:30:48,637 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 5430 transitions. Word has length 1623 [2025-03-08 21:30:48,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:48,638 INFO L471 AbstractCegarLoop]: Abstraction has 3944 states and 5430 transitions. [2025-03-08 21:30:48,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 5430 transitions. [2025-03-08 21:30:48,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2025-03-08 21:30:48,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:48,654 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:48,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 21:30:48,654 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:48,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:48,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2033677405, now seen corresponding path program 1 times [2025-03-08 21:30:48,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:48,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550107689] [2025-03-08 21:30:48,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:48,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:48,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-08 21:30:49,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-08 21:30:49,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:49,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7238 trivial. 0 not checked. [2025-03-08 21:30:51,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:51,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550107689] [2025-03-08 21:30:51,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550107689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:30:51,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:30:51,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 21:30:51,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560725698] [2025-03-08 21:30:51,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:30:51,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:30:51,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:30:51,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:30:51,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:30:51,973 INFO L87 Difference]: Start difference. First operand 3944 states and 5430 transitions. Second operand has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:30:52,303 INFO L93 Difference]: Finished difference Result 4794 states and 6695 transitions. [2025-03-08 21:30:52,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:30:52,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1624 [2025-03-08 21:30:52,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:30:52,312 INFO L225 Difference]: With dead ends: 4794 [2025-03-08 21:30:52,312 INFO L226 Difference]: Without dead ends: 3947 [2025-03-08 21:30:52,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:30:52,315 INFO L435 NwaCegarLoop]: 1147 mSDtfsCounter, 16 mSDsluCounter, 3260 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4407 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 21:30:52,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4407 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 21:30:52,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3947 states. [2025-03-08 21:30:52,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3947 to 3947. [2025-03-08 21:30:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3947 states, 3880 states have (on average 1.3701030927835052) internal successors, (5316), 3889 states have internal predecessors, (5316), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 21:30:52,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3947 states to 3947 states and 5433 transitions. [2025-03-08 21:30:52,370 INFO L78 Accepts]: Start accepts. Automaton has 3947 states and 5433 transitions. Word has length 1624 [2025-03-08 21:30:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:30:52,371 INFO L471 AbstractCegarLoop]: Abstraction has 3947 states and 5433 transitions. [2025-03-08 21:30:52,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:30:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3947 states and 5433 transitions. [2025-03-08 21:30:52,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2025-03-08 21:30:52,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:30:52,386 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:30:52,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 21:30:52,386 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:30:52,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:30:52,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1399373452, now seen corresponding path program 1 times [2025-03-08 21:30:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:30:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167514320] [2025-03-08 21:30:52,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:52,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:30:52,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-08 21:30:53,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-08 21:30:53,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:53,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 1961 proven. 74 refuted. 0 times theorem prover too weak. 5203 trivial. 0 not checked. [2025-03-08 21:30:57,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:30:57,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167514320] [2025-03-08 21:30:57,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167514320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:30:57,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593745043] [2025-03-08 21:30:57,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:30:57,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:30:57,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:30:57,670 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:30:57,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 21:30:58,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-03-08 21:30:59,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-03-08 21:30:59,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:30:59,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:30:59,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 7914 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 21:30:59,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:30:59,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:31:00,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:31:00,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:31:00,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:31:00,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:31:00,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:31:00,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:31:00,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:31:00,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:31:01,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:31:01,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 21:31:01,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 21:31:01,154 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 42 proven. 7172 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:31:01,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:31:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7238 backedges. 42 proven. 7172 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 21:31:02,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593745043] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:31:02,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:31:02,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 16] total 34 [2025-03-08 21:31:02,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271312540] [2025-03-08 21:31:02,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:31:02,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 21:31:02,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:31:02,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 21:31:02,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=735, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 21:31:02,702 INFO L87 Difference]: Start difference. First operand 3947 states and 5433 transitions. Second operand has 34 states, 34 states have (on average 97.11764705882354) internal successors, (3302), 34 states have internal predecessors, (3302), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 21:31:04,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:31:04,781 INFO L93 Difference]: Finished difference Result 8176 states and 11270 transitions. [2025-03-08 21:31:04,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-08 21:31:04,783 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 97.11764705882354) internal successors, (3302), 34 states have internal predecessors, (3302), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 1624 [2025-03-08 21:31:04,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:31:04,802 INFO L225 Difference]: With dead ends: 8176 [2025-03-08 21:31:04,802 INFO L226 Difference]: Without dead ends: 7271 [2025-03-08 21:31:04,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3303 GetRequests, 3217 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1731, Invalid=4749, Unknown=0, NotChecked=0, Total=6480 [2025-03-08 21:31:04,807 INFO L435 NwaCegarLoop]: 1088 mSDtfsCounter, 8595 mSDsluCounter, 10529 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8667 SdHoareTripleChecker+Valid, 11617 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 21:31:04,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8667 Valid, 11617 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 21:31:04,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7271 states. [2025-03-08 21:31:04,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7271 to 7269. [2025-03-08 21:31:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7269 states, 7136 states have (on average 1.3553811659192825) internal successors, (9672), 7145 states have internal predecessors, (9672), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-08 21:31:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7269 states to 7269 states and 9921 transitions. [2025-03-08 21:31:04,912 INFO L78 Accepts]: Start accepts. Automaton has 7269 states and 9921 transitions. Word has length 1624 [2025-03-08 21:31:04,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:31:04,914 INFO L471 AbstractCegarLoop]: Abstraction has 7269 states and 9921 transitions. [2025-03-08 21:31:04,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 97.11764705882354) internal successors, (3302), 34 states have internal predecessors, (3302), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 21:31:04,914 INFO L276 IsEmpty]: Start isEmpty. Operand 7269 states and 9921 transitions. [2025-03-08 21:31:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3275 [2025-03-08 21:31:04,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:31:04,962 INFO L218 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 23, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:31:04,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 21:31:05,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:31:05,163 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:31:05,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:31:05,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1770192876, now seen corresponding path program 2 times [2025-03-08 21:31:05,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:31:05,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993702502] [2025-03-08 21:31:05,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:31:05,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:31:05,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3274 statements into 2 equivalence classes. [2025-03-08 21:31:05,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 79 of 3274 statements. [2025-03-08 21:31:05,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:31:05,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:31:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 42713 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42713 trivial. 0 not checked. [2025-03-08 21:31:06,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:31:06,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993702502] [2025-03-08 21:31:06,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993702502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:31:06,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:31:06,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:31:06,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174631750] [2025-03-08 21:31:06,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:31:06,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:31:06,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:31:06,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:31:06,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:31:06,107 INFO L87 Difference]: Start difference. First operand 7269 states and 9921 transitions. Second operand has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:31:10,488 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 [] [2025-03-08 21:31:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:31:11,007 INFO L93 Difference]: Finished difference Result 8135 states and 11206 transitions. [2025-03-08 21:31:11,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 21:31:11,007 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 3274 [2025-03-08 21:31:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:31:11,022 INFO L225 Difference]: With dead ends: 8135 [2025-03-08 21:31:11,022 INFO L226 Difference]: Without dead ends: 7314 [2025-03-08 21:31:11,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:31:11,025 INFO L435 NwaCegarLoop]: 1148 mSDtfsCounter, 85 mSDsluCounter, 9949 mSDsCounter, 0 mSdLazyCounter, 1772 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 11097 SdHoareTripleChecker+Invalid, 1780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1772 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-08 21:31:11,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 11097 Invalid, 1780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1772 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-03-08 21:31:11,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7314 states. [2025-03-08 21:31:11,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7314 to 7275. [2025-03-08 21:31:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7275 states, 7142 states have (on average 1.3553626435172221) internal successors, (9680), 7151 states have internal predecessors, (9680), 125 states have call successors, (125), 7 states have call predecessors, (125), 7 states have return successors, (124), 118 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-08 21:31:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7275 states to 7275 states and 9929 transitions. [2025-03-08 21:31:11,214 INFO L78 Accepts]: Start accepts. Automaton has 7275 states and 9929 transitions. Word has length 3274 [2025-03-08 21:31:11,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:31:11,217 INFO L471 AbstractCegarLoop]: Abstraction has 7275 states and 9929 transitions. [2025-03-08 21:31:11,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 21:31:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 7275 states and 9929 transitions. [2025-03-08 21:31:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3276 [2025-03-08 21:31:11,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:31:11,262 INFO L218 NwaCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 23, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:31:11,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 21:31:11,263 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 21:31:11,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:31:11,272 INFO L85 PathProgramCache]: Analyzing trace with hash -313786262, now seen corresponding path program 1 times [2025-03-08 21:31:11,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:31:11,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534302671] [2025-03-08 21:31:11,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:31:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:31:11,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3275 statements into 1 equivalence classes. [2025-03-08 21:31:13,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3275 of 3275 statements. [2025-03-08 21:31:13,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:31:13,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat