./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_ctm.4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/rekh_ctm.4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 436e6e57c04bd43264564f478c3aa92ec3799e6c36d71ae9bac6692f2873338f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:33:46,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:33:46,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:33:46,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:33:46,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:33:46,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:33:46,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:33:46,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:33:46,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:33:46,106 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:33:46,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:33:46,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:33:46,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:33:46,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:33:46,107 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:33:46,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:33:46,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:33:46,107 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:33:46,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:33:46,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:33:46,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:33:46,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:33:46,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:33:46,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:33:46,108 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:33:46,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:33:46,108 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:33:46,108 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:33:46,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:33:46,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:33:46,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:33:46,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:33:46,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:33:46,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:33:46,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:33:46,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:33:46,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:33:46,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:33:46,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:33:46,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:33:46,109 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:33:46,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:33:46,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:33:46,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:33:46,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:33:46,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:33:46,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:33:46,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:33:46,110 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-jdk21/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 -> 436e6e57c04bd43264564f478c3aa92ec3799e6c36d71ae9bac6692f2873338f [2025-01-09 04:33:46,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:33:46,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:33:46,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:33:46,347 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:33:46,347 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:33:46,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_ctm.4.c [2025-01-09 04:33:47,654 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1bd5f288/965ca1dd9dd34c3bb64fe35f7c2f85ee/FLAG9683d3d8a [2025-01-09 04:33:48,065 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:33:48,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.4.c [2025-01-09 04:33:48,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1bd5f288/965ca1dd9dd34c3bb64fe35f7c2f85ee/FLAG9683d3d8a [2025-01-09 04:33:48,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1bd5f288/965ca1dd9dd34c3bb64fe35f7c2f85ee [2025-01-09 04:33:48,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:33:48,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:33:48,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:33:48,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:33:48,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:33:48,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:33:48" (1/1) ... [2025-01-09 04:33:48,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3867afc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:48, skipping insertion in model container [2025-01-09 04:33:48,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:33:48" (1/1) ... [2025-01-09 04:33:48,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:33:48,483 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.4.c[1868,1881] [2025-01-09 04:33:48,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:33:48,909 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:33:48,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/ctm.ok4.i","-S") [42] [2025-01-09 04:33:48,924 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.4.c[1868,1881] [2025-01-09 04:33:49,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:33:49,179 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:33:49,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:49 WrapperNode [2025-01-09 04:33:49,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:33:49,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:33:49,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:33:49,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:33:49,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:49" (1/1) ... [2025-01-09 04:33:49,246 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:49" (1/1) ... [2025-01-09 04:33:49,442 INFO L138 Inliner]: procedures = 99, calls = 2906, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 8763 [2025-01-09 04:33:49,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:33:49,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:33:49,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:33:49,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:33:49,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:49" (1/1) ... [2025-01-09 04:33:49,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:49" (1/1) ... [2025-01-09 04:33:49,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:49" (1/1) ... [2025-01-09 04:33:49,565 INFO L175 MemorySlicer]: Split 2508 memory accesses to 49 slices as follows [2, 80, 86, 37, 37, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46, 57, 46]. 3 percent of accesses are in the largest equivalence class. The 338 initializations are split as follows [2, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]. The 490 writes are split as follows [0, 7, 7, 7, 7, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6, 15, 6]. [2025-01-09 04:33:49,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:49" (1/1) ... [2025-01-09 04:33:49,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:49" (1/1) ... [2025-01-09 04:33:49,705 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:49" (1/1) ... [2025-01-09 04:33:49,716 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:49" (1/1) ... [2025-01-09 04:33:49,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:49" (1/1) ... [2025-01-09 04:33:49,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:49" (1/1) ... [2025-01-09 04:33:49,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:49" (1/1) ... [2025-01-09 04:33:49,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:33:49,841 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:33:49,841 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:33:49,841 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:33:49,842 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:49" (1/1) ... [2025-01-09 04:33:49,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:33:49,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:33:49,867 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:33:49,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:33:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_state [2025-01-09 04:33:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_state [2025-01-09 04:33:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_state [2025-01-09 04:33:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_state [2025-01-09 04:33:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 04:33:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 04:33:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 04:33:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 04:33:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 04:33:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 04:33:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 04:33:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 04:33:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 04:33:49,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 04:33:49,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 04:33:49,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 04:33:49,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 04:33:49,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 04:33:49,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 04:33:49,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 04:33:49,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#30 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#31 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#32 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#33 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#34 [2025-01-09 04:33:49,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#35 [2025-01-09 04:33:49,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#36 [2025-01-09 04:33:49,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#37 [2025-01-09 04:33:49,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#38 [2025-01-09 04:33:49,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#39 [2025-01-09 04:33:49,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#40 [2025-01-09 04:33:49,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#41 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#42 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#43 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#44 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#45 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#46 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#47 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#48 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_run_nxtbg [2025-01-09 04:33:49,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_run_nxtbg [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-01-09 04:33:49,891 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write___startrek_current_priority [2025-01-09 04:33:49,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write___startrek_current_priority [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_input [2025-01-09 04:33:49,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_input [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_hyperperiod [2025-01-09 04:33:49,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_hyperperiod [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure bg_nxtcolorsensor [2025-01-09 04:33:49,891 INFO L138 BoogieDeclarations]: Found implementation of procedure bg_nxtcolorsensor [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Writer [2025-01-09 04:33:49,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Writer [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_mode [2025-01-09 04:33:49,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_mode [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 04:33:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#30 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#31 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#32 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#33 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#34 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#35 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#36 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#37 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#38 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#39 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#40 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#41 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#42 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#43 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#44 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#45 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#46 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#47 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#48 [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-01-09 04:33:49,892 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-01-09 04:33:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_count [2025-01-09 04:33:49,892 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_count [2025-01-09 04:33:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_state [2025-01-09 04:33:49,894 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_state [2025-01-09 04:33:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_output [2025-01-09 04:33:49,894 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_output [2025-01-09 04:33:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure move_motor [2025-01-09 04:33:49,894 INFO L138 BoogieDeclarations]: Found implementation of procedure move_motor [2025-01-09 04:33:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_speed [2025-01-09 04:33:49,894 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_speed [2025-01-09 04:33:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_set_nxtcolorsensor [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_set_nxtcolorsensor [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t3 [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t3 [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_output [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_output [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_count [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_count [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure TerminateTask [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure TerminateTask [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_count [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_count [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read___startrek_current_priority [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read___startrek_current_priority [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_count [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_count [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_count [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_count [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_speed [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_speed [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_data_mode [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_data_mode [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_threshold [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_threshold [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_read [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_read [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_state [2025-01-09 04:33:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_state [2025-01-09 04:33:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Reader [2025-01-09 04:33:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Reader [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_dir [2025-01-09 04:33:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_dir [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_speed [2025-01-09 04:33:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_speed [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_input [2025-01-09 04:33:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_input [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_state [2025-01-09 04:33:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_state [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_need_to_run_nxtbg [2025-01-09 04:33:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_need_to_run_nxtbg [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_state [2025-01-09 04:33:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_state [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_count [2025-01-09 04:33:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_count [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_TapeMover [2025-01-09 04:33:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_TapeMover [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 04:33:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 04:33:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 04:33:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 04:33:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 04:33:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-01-09 04:33:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-01-09 04:33:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#30 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#31 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#32 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#33 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#34 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#35 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#36 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#37 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#38 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#39 [2025-01-09 04:33:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#40 [2025-01-09 04:33:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#41 [2025-01-09 04:33:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#42 [2025-01-09 04:33:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#43 [2025-01-09 04:33:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#44 [2025-01-09 04:33:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#45 [2025-01-09 04:33:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#46 [2025-01-09 04:33:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#47 [2025-01-09 04:33:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#48 [2025-01-09 04:33:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Controller [2025-01-09 04:33:49,899 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Controller [2025-01-09 04:33:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:33:49,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:33:50,331 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:33:50,333 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:33:59,315 INFO L? ?]: Removed 946 outVars from TransFormulas that were not future-live. [2025-01-09 04:33:59,315 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:33:59,368 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:33:59,368 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 04:33:59,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:33:59 BoogieIcfgContainer [2025-01-09 04:33:59,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:33:59,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:33:59,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:33:59,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:33:59,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:33:48" (1/3) ... [2025-01-09 04:33:59,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587ec6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:33:59, skipping insertion in model container [2025-01-09 04:33:59,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:49" (2/3) ... [2025-01-09 04:33:59,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587ec6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:33:59, skipping insertion in model container [2025-01-09 04:33:59,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:33:59" (3/3) ... [2025-01-09 04:33:59,377 INFO L128 eAbstractionObserver]: Analyzing ICFG rekh_ctm.4.c [2025-01-09 04:33:59,386 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:33:59,390 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_ctm.4.c that has 45 procedures, 2469 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:33:59,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:33:59,480 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;@345bb233, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:33:59,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:33:59,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 2469 states, 2115 states have (on average 1.4799054373522458) internal successors, (3130), 2139 states have internal predecessors, (3130), 308 states have call successors, (308), 44 states have call predecessors, (308), 44 states have return successors, (308), 298 states have call predecessors, (308), 308 states have call successors, (308) [2025-01-09 04:33:59,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 04:33:59,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:59,506 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:33:59,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:33:59,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:33:59,512 INFO L85 PathProgramCache]: Analyzing trace with hash -958606310, now seen corresponding path program 1 times [2025-01-09 04:33:59,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:33:59,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335155794] [2025-01-09 04:33:59,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:59,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:00,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 04:34:00,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 04:34:00,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:00,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:34:00,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:00,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335155794] [2025-01-09 04:34:00,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335155794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:00,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:00,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:34:00,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232818687] [2025-01-09 04:34:00,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:00,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:34:00,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:00,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:34:00,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:34:00,567 INFO L87 Difference]: Start difference. First operand has 2469 states, 2115 states have (on average 1.4799054373522458) internal successors, (3130), 2139 states have internal predecessors, (3130), 308 states have call successors, (308), 44 states have call predecessors, (308), 44 states have return successors, (308), 298 states have call predecessors, (308), 308 states have call successors, (308) Second operand has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:34:00,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:00,783 INFO L93 Difference]: Finished difference Result 4929 states and 7742 transitions. [2025-01-09 04:34:00,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:34:00,785 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 148 [2025-01-09 04:34:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:00,817 INFO L225 Difference]: With dead ends: 4929 [2025-01-09 04:34:00,817 INFO L226 Difference]: Without dead ends: 2456 [2025-01-09 04:34:00,848 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-01-09 04:34:00,851 INFO L435 NwaCegarLoop]: 3050 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:00,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:34:00,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2025-01-09 04:34:00,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2456. [2025-01-09 04:34:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2456 states, 2103 states have (on average 1.1535901093675702) internal successors, (2426), 2127 states have internal predecessors, (2426), 308 states have call successors, (308), 44 states have call predecessors, (308), 44 states have return successors, (307), 297 states have call predecessors, (307), 307 states have call successors, (307) [2025-01-09 04:34:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 3041 transitions. [2025-01-09 04:34:01,029 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 3041 transitions. Word has length 148 [2025-01-09 04:34:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:01,029 INFO L471 AbstractCegarLoop]: Abstraction has 2456 states and 3041 transitions. [2025-01-09 04:34:01,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:34:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 3041 transitions. [2025-01-09 04:34:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 04:34:01,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:01,046 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:34:01,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:34:01,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:01,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:01,048 INFO L85 PathProgramCache]: Analyzing trace with hash -276931705, now seen corresponding path program 1 times [2025-01-09 04:34:01,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:01,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733898820] [2025-01-09 04:34:01,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:01,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:01,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 04:34:01,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 04:34:01,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:01,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 04:34:02,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:02,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733898820] [2025-01-09 04:34:02,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733898820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:02,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:02,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:02,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157324148] [2025-01-09 04:34:02,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:02,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:02,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:02,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:02,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:02,557 INFO L87 Difference]: Start difference. First operand 2456 states and 3041 transitions. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:05,293 INFO L93 Difference]: Finished difference Result 5566 states and 6995 transitions. [2025-01-09 04:34:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:05,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 208 [2025-01-09 04:34:05,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:05,310 INFO L225 Difference]: With dead ends: 5566 [2025-01-09 04:34:05,310 INFO L226 Difference]: Without dead ends: 3115 [2025-01-09 04:34:05,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:05,423 INFO L435 NwaCegarLoop]: 3655 mSDtfsCounter, 3891 mSDsluCounter, 5596 mSDsCounter, 0 mSdLazyCounter, 2558 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3891 SdHoareTripleChecker+Valid, 9251 SdHoareTripleChecker+Invalid, 2569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:05,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3891 Valid, 9251 Invalid, 2569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2558 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 04:34:05,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2025-01-09 04:34:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 2979. [2025-01-09 04:34:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2979 states, 2478 states have (on average 1.1864406779661016) internal successors, (2940), 2508 states have internal predecessors, (2940), 423 states have call successors, (423), 77 states have call predecessors, (423), 77 states have return successors, (422), 408 states have call predecessors, (422), 422 states have call successors, (422) [2025-01-09 04:34:05,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2979 states and 3785 transitions. [2025-01-09 04:34:05,512 INFO L78 Accepts]: Start accepts. Automaton has 2979 states and 3785 transitions. Word has length 208 [2025-01-09 04:34:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:05,513 INFO L471 AbstractCegarLoop]: Abstraction has 2979 states and 3785 transitions. [2025-01-09 04:34:05,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:05,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2979 states and 3785 transitions. [2025-01-09 04:34:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 04:34:05,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:05,518 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] [2025-01-09 04:34:05,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:34:05,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:05,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:05,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1847461033, now seen corresponding path program 1 times [2025-01-09 04:34:05,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:05,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834682295] [2025-01-09 04:34:05,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:05,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:05,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 04:34:06,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 04:34:06,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:06,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:34:06,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:06,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834682295] [2025-01-09 04:34:06,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834682295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:06,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:06,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:06,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862801958] [2025-01-09 04:34:06,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:06,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:06,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:06,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:06,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:06,540 INFO L87 Difference]: Start difference. First operand 2979 states and 3785 transitions. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:08,994 INFO L93 Difference]: Finished difference Result 6465 states and 8276 transitions. [2025-01-09 04:34:08,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:08,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 209 [2025-01-09 04:34:08,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:09,015 INFO L225 Difference]: With dead ends: 6465 [2025-01-09 04:34:09,016 INFO L226 Difference]: Without dead ends: 3491 [2025-01-09 04:34:09,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:09,034 INFO L435 NwaCegarLoop]: 3532 mSDtfsCounter, 6685 mSDsluCounter, 2729 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 801 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6685 SdHoareTripleChecker+Valid, 6261 SdHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 801 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:09,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6685 Valid, 6261 Invalid, 2098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [801 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 04:34:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3491 states. [2025-01-09 04:34:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3491 to 3353. [2025-01-09 04:34:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3353 states, 2754 states have (on average 1.2058823529411764) internal successors, (3321), 2793 states have internal predecessors, (3321), 500 states have call successors, (500), 98 states have call predecessors, (500), 98 states have return successors, (499), 481 states have call predecessors, (499), 499 states have call successors, (499) [2025-01-09 04:34:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 3353 states and 4320 transitions. [2025-01-09 04:34:09,159 INFO L78 Accepts]: Start accepts. Automaton has 3353 states and 4320 transitions. Word has length 209 [2025-01-09 04:34:09,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:09,161 INFO L471 AbstractCegarLoop]: Abstraction has 3353 states and 4320 transitions. [2025-01-09 04:34:09,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3353 states and 4320 transitions. [2025-01-09 04:34:09,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 04:34:09,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:09,168 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:34:09,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:34:09,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:09,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:09,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1685043674, now seen corresponding path program 1 times [2025-01-09 04:34:09,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:09,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581129179] [2025-01-09 04:34:09,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:09,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:09,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 04:34:09,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 04:34:09,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:09,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:34:10,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:10,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581129179] [2025-01-09 04:34:10,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581129179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:10,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:10,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:34:10,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720679850] [2025-01-09 04:34:10,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:10,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:10,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:10,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:10,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:34:10,673 INFO L87 Difference]: Start difference. First operand 3353 states and 4320 transitions. Second operand has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:34:12,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:12,846 INFO L93 Difference]: Finished difference Result 7075 states and 9180 transitions. [2025-01-09 04:34:12,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:12,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 205 [2025-01-09 04:34:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:12,868 INFO L225 Difference]: With dead ends: 7075 [2025-01-09 04:34:12,868 INFO L226 Difference]: Without dead ends: 3727 [2025-01-09 04:34:12,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:12,891 INFO L435 NwaCegarLoop]: 3426 mSDtfsCounter, 5712 mSDsluCounter, 2607 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5712 SdHoareTripleChecker+Valid, 6033 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:12,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5712 Valid, 6033 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 04:34:12,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2025-01-09 04:34:13,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3725. [2025-01-09 04:34:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3725 states, 3029 states have (on average 1.2218553978210631) internal successors, (3701), 3074 states have internal predecessors, (3701), 577 states have call successors, (577), 118 states have call predecessors, (577), 118 states have return successors, (576), 556 states have call predecessors, (576), 576 states have call successors, (576) [2025-01-09 04:34:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3725 states to 3725 states and 4854 transitions. [2025-01-09 04:34:13,063 INFO L78 Accepts]: Start accepts. Automaton has 3725 states and 4854 transitions. Word has length 205 [2025-01-09 04:34:13,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:13,063 INFO L471 AbstractCegarLoop]: Abstraction has 3725 states and 4854 transitions. [2025-01-09 04:34:13,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:34:13,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3725 states and 4854 transitions. [2025-01-09 04:34:13,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 04:34:13,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:13,068 INFO L218 NwaCegarLoop]: trace histogram [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, 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-01-09 04:34:13,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:34:13,068 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:13,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:13,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1779232255, now seen corresponding path program 1 times [2025-01-09 04:34:13,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:13,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26380504] [2025-01-09 04:34:13,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:13,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:13,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 04:34:13,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 04:34:13,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:13,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 04:34:14,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:14,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26380504] [2025-01-09 04:34:14,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26380504] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:34:14,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891196373] [2025-01-09 04:34:14,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:14,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:14,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:34:14,058 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:34:14,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:34:14,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 04:34:15,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 04:34:15,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:15,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:15,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 2846 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 04:34:15,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:34:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:34:15,298 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:34:15,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891196373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:15,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:34:15,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 04:34:15,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26531264] [2025-01-09 04:34:15,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:15,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:15,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:15,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:15,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:15,300 INFO L87 Difference]: Start difference. First operand 3725 states and 4854 transitions. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:16,608 INFO L93 Difference]: Finished difference Result 7682 states and 9997 transitions. [2025-01-09 04:34:16,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:16,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 208 [2025-01-09 04:34:16,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:16,626 INFO L225 Difference]: With dead ends: 7682 [2025-01-09 04:34:16,627 INFO L226 Difference]: Without dead ends: 3848 [2025-01-09 04:34:16,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:34:16,643 INFO L435 NwaCegarLoop]: 3604 mSDtfsCounter, 1465 mSDsluCounter, 6346 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 9950 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:16,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 9950 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:34:16,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3848 states. [2025-01-09 04:34:16,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3848 to 3712. [2025-01-09 04:34:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3712 states, 3021 states have (on average 1.2204568023833169) internal successors, (3687), 3066 states have internal predecessors, (3687), 572 states have call successors, (572), 118 states have call predecessors, (572), 118 states have return successors, (571), 551 states have call predecessors, (571), 571 states have call successors, (571) [2025-01-09 04:34:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 4830 transitions. [2025-01-09 04:34:16,754 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 4830 transitions. Word has length 208 [2025-01-09 04:34:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:16,755 INFO L471 AbstractCegarLoop]: Abstraction has 3712 states and 4830 transitions. [2025-01-09 04:34:16,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 4830 transitions. [2025-01-09 04:34:16,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 04:34:16,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:16,759 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 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-01-09 04:34:16,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 04:34:16,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:16,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:16,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:16,962 INFO L85 PathProgramCache]: Analyzing trace with hash -59740356, now seen corresponding path program 1 times [2025-01-09 04:34:16,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:16,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962796861] [2025-01-09 04:34:16,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:16,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:17,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 04:34:17,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 04:34:17,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:17,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:34:17,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:17,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962796861] [2025-01-09 04:34:17,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962796861] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:34:17,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414189892] [2025-01-09 04:34:17,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:17,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:17,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:34:17,682 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:34:17,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:34:18,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 04:34:18,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 04:34:18,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:18,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:18,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:34:18,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:34:18,847 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:34:18,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:34:18,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414189892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:18,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:34:18,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 04:34:18,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674626940] [2025-01-09 04:34:18,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:18,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:18,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:18,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:18,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:18,849 INFO L87 Difference]: Start difference. First operand 3712 states and 4830 transitions. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:19,926 INFO L93 Difference]: Finished difference Result 7613 states and 9892 transitions. [2025-01-09 04:34:19,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:19,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 209 [2025-01-09 04:34:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:19,943 INFO L225 Difference]: With dead ends: 7613 [2025-01-09 04:34:19,943 INFO L226 Difference]: Without dead ends: 3840 [2025-01-09 04:34:19,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:34:19,957 INFO L435 NwaCegarLoop]: 3578 mSDtfsCounter, 1205 mSDsluCounter, 8716 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 12294 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:19,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 12294 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:34:19,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3840 states. [2025-01-09 04:34:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3840 to 3702. [2025-01-09 04:34:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3702 states, 3015 states have (on average 1.2192371475953565) internal successors, (3676), 3060 states have internal predecessors, (3676), 568 states have call successors, (568), 118 states have call predecessors, (568), 118 states have return successors, (567), 547 states have call predecessors, (567), 567 states have call successors, (567) [2025-01-09 04:34:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 4811 transitions. [2025-01-09 04:34:20,055 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 4811 transitions. Word has length 209 [2025-01-09 04:34:20,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:20,055 INFO L471 AbstractCegarLoop]: Abstraction has 3702 states and 4811 transitions. [2025-01-09 04:34:20,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 4811 transitions. [2025-01-09 04:34:20,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 04:34:20,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:20,059 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 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-01-09 04:34:20,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:34:20,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:20,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:20,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:20,263 INFO L85 PathProgramCache]: Analyzing trace with hash 549106331, now seen corresponding path program 1 times [2025-01-09 04:34:20,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:20,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588483493] [2025-01-09 04:34:20,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:20,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:20,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 04:34:20,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 04:34:20,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:20,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:34:20,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:20,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588483493] [2025-01-09 04:34:20,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588483493] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:34:20,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797546466] [2025-01-09 04:34:20,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:20,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:34:20,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:34:20,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:34:21,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 04:34:22,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 04:34:22,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:22,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:22,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 2850 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:34:22,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:34:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:34:22,153 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:34:22,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797546466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:22,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:34:22,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 04:34:22,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434890881] [2025-01-09 04:34:22,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:22,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:22,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:22,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:22,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:22,154 INFO L87 Difference]: Start difference. First operand 3702 states and 4811 transitions. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:23,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:23,460 INFO L93 Difference]: Finished difference Result 8202 states and 10659 transitions. [2025-01-09 04:34:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:23,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 210 [2025-01-09 04:34:23,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:23,488 INFO L225 Difference]: With dead ends: 8202 [2025-01-09 04:34:23,488 INFO L226 Difference]: Without dead ends: 4505 [2025-01-09 04:34:23,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:34:23,502 INFO L435 NwaCegarLoop]: 3793 mSDtfsCounter, 1718 mSDsluCounter, 6877 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1718 SdHoareTripleChecker+Valid, 10670 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:23,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1718 Valid, 10670 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:34:23,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2025-01-09 04:34:23,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 4176. [2025-01-09 04:34:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 3357 states have (on average 1.2347333929103366) internal successors, (4145), 3413 states have internal predecessors, (4145), 676 states have call successors, (676), 141 states have call predecessors, (676), 142 states have return successors, (676), 651 states have call predecessors, (676), 675 states have call successors, (676) [2025-01-09 04:34:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 5497 transitions. [2025-01-09 04:34:23,614 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 5497 transitions. Word has length 210 [2025-01-09 04:34:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:23,616 INFO L471 AbstractCegarLoop]: Abstraction has 4176 states and 5497 transitions. [2025-01-09 04:34:23,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 5497 transitions. [2025-01-09 04:34:23,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 04:34:23,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:23,622 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 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-01-09 04:34:23,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 04:34:23,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:23,823 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:23,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:23,824 INFO L85 PathProgramCache]: Analyzing trace with hash -24421537, now seen corresponding path program 1 times [2025-01-09 04:34:23,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:23,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487950730] [2025-01-09 04:34:23,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:23,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:24,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 04:34:24,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 04:34:24,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:24,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:34:24,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:24,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487950730] [2025-01-09 04:34:24,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487950730] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:34:24,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099838409] [2025-01-09 04:34:24,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:24,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:24,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:34:24,463 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:34:24,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 04:34:25,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 04:34:25,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 04:34:25,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:25,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:25,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:34:25,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:34:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:34:25,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:34:25,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099838409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:25,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:34:25,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 04:34:25,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159323643] [2025-01-09 04:34:25,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:25,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:25,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:25,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:25,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:25,661 INFO L87 Difference]: Start difference. First operand 4176 states and 5497 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:26,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:26,730 INFO L93 Difference]: Finished difference Result 8349 states and 11000 transitions. [2025-01-09 04:34:26,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:26,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 210 [2025-01-09 04:34:26,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:26,758 INFO L225 Difference]: With dead ends: 8349 [2025-01-09 04:34:26,759 INFO L226 Difference]: Without dead ends: 4178 [2025-01-09 04:34:26,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:34:26,774 INFO L435 NwaCegarLoop]: 2953 mSDtfsCounter, 1039 mSDsluCounter, 5769 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 8722 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:26,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 8722 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:34:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4178 states. [2025-01-09 04:34:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4178 to 4176. [2025-01-09 04:34:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 3357 states have (on average 1.2344355078939528) internal successors, (4144), 3413 states have internal predecessors, (4144), 676 states have call successors, (676), 141 states have call predecessors, (676), 142 states have return successors, (676), 651 states have call predecessors, (676), 675 states have call successors, (676) [2025-01-09 04:34:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 5496 transitions. [2025-01-09 04:34:26,882 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 5496 transitions. Word has length 210 [2025-01-09 04:34:26,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:26,883 INFO L471 AbstractCegarLoop]: Abstraction has 4176 states and 5496 transitions. [2025-01-09 04:34:26,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:34:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 5496 transitions. [2025-01-09 04:34:26,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 04:34:26,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:26,888 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:34:26,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 04:34:27,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 04:34:27,089 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:27,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:27,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1723333477, now seen corresponding path program 1 times [2025-01-09 04:34:27,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:27,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358641293] [2025-01-09 04:34:27,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:27,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:27,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 04:34:27,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 04:34:27,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:27,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 04:34:28,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:28,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358641293] [2025-01-09 04:34:28,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358641293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:28,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:28,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:28,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243462387] [2025-01-09 04:34:28,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:28,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:28,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:28,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:28,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:28,255 INFO L87 Difference]: Start difference. First operand 4176 states and 5496 transitions. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:30,541 INFO L93 Difference]: Finished difference Result 7867 states and 10296 transitions. [2025-01-09 04:34:30,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:30,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220 [2025-01-09 04:34:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:30,557 INFO L225 Difference]: With dead ends: 7867 [2025-01-09 04:34:30,557 INFO L226 Difference]: Without dead ends: 3696 [2025-01-09 04:34:30,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:34:30,572 INFO L435 NwaCegarLoop]: 3496 mSDtfsCounter, 4661 mSDsluCounter, 3454 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4661 SdHoareTripleChecker+Valid, 6950 SdHoareTripleChecker+Invalid, 2107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:30,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4661 Valid, 6950 Invalid, 2107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 04:34:30,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3696 states. [2025-01-09 04:34:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3696 to 3694. [2025-01-09 04:34:30,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3694 states, 3010 states have (on average 1.217607973421927) internal successors, (3665), 3055 states have internal predecessors, (3665), 565 states have call successors, (565), 118 states have call predecessors, (565), 118 states have return successors, (564), 544 states have call predecessors, (564), 564 states have call successors, (564) [2025-01-09 04:34:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 4794 transitions. [2025-01-09 04:34:30,666 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 4794 transitions. Word has length 220 [2025-01-09 04:34:30,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:30,667 INFO L471 AbstractCegarLoop]: Abstraction has 3694 states and 4794 transitions. [2025-01-09 04:34:30,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:30,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 4794 transitions. [2025-01-09 04:34:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 04:34:30,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:30,671 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:34:30,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:34:30,671 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:30,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:30,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1266910840, now seen corresponding path program 1 times [2025-01-09 04:34:30,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:30,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776666050] [2025-01-09 04:34:30,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:30,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:30,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 04:34:30,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 04:34:30,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:30,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:34:31,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:31,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776666050] [2025-01-09 04:34:31,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776666050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:31,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:31,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:31,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771945441] [2025-01-09 04:34:31,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:31,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:31,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:31,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:31,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:31,366 INFO L87 Difference]: Start difference. First operand 3694 states and 4794 transitions. Second operand has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 04:34:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:33,491 INFO L93 Difference]: Finished difference Result 7385 states and 9593 transitions. [2025-01-09 04:34:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:33,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 220 [2025-01-09 04:34:33,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:33,521 INFO L225 Difference]: With dead ends: 7385 [2025-01-09 04:34:33,521 INFO L226 Difference]: Without dead ends: 3696 [2025-01-09 04:34:33,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:34:33,547 INFO L435 NwaCegarLoop]: 3402 mSDtfsCounter, 3636 mSDsluCounter, 5186 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3636 SdHoareTripleChecker+Valid, 8588 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:33,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3636 Valid, 8588 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 04:34:33,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3696 states. [2025-01-09 04:34:33,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3696 to 3694. [2025-01-09 04:34:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3694 states, 3010 states have (on average 1.2172757475083056) internal successors, (3664), 3055 states have internal predecessors, (3664), 565 states have call successors, (565), 118 states have call predecessors, (565), 118 states have return successors, (564), 544 states have call predecessors, (564), 564 states have call successors, (564) [2025-01-09 04:34:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 4793 transitions. [2025-01-09 04:34:33,754 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 4793 transitions. Word has length 220 [2025-01-09 04:34:33,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:33,758 INFO L471 AbstractCegarLoop]: Abstraction has 3694 states and 4793 transitions. [2025-01-09 04:34:33,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 04:34:33,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 4793 transitions. [2025-01-09 04:34:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-01-09 04:34:33,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:33,766 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:34:33,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:34:33,766 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:33,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:33,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2125021893, now seen corresponding path program 1 times [2025-01-09 04:34:33,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:33,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730383757] [2025-01-09 04:34:33,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:33,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:34,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 04:34:34,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 04:34:34,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:34,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:34:34,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:34,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730383757] [2025-01-09 04:34:34,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730383757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:34,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:34,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:34,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250153457] [2025-01-09 04:34:34,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:34,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:34,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:34,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:34,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:34,440 INFO L87 Difference]: Start difference. First operand 3694 states and 4793 transitions. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 04:34:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:36,417 INFO L93 Difference]: Finished difference Result 7517 states and 9739 transitions. [2025-01-09 04:34:36,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:36,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 223 [2025-01-09 04:34:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:36,447 INFO L225 Difference]: With dead ends: 7517 [2025-01-09 04:34:36,448 INFO L226 Difference]: Without dead ends: 3828 [2025-01-09 04:34:36,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:36,476 INFO L435 NwaCegarLoop]: 3631 mSDtfsCounter, 6933 mSDsluCounter, 2782 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 850 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6933 SdHoareTripleChecker+Valid, 6413 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 850 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:36,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6933 Valid, 6413 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [850 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 04:34:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2025-01-09 04:34:36,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3692. [2025-01-09 04:34:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3692 states, 3009 states have (on average 1.217015619807245) internal successors, (3662), 3054 states have internal predecessors, (3662), 564 states have call successors, (564), 118 states have call predecessors, (564), 118 states have return successors, (563), 543 states have call predecessors, (563), 563 states have call successors, (563) [2025-01-09 04:34:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 4789 transitions. [2025-01-09 04:34:36,690 INFO L78 Accepts]: Start accepts. Automaton has 3692 states and 4789 transitions. Word has length 223 [2025-01-09 04:34:36,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:36,695 INFO L471 AbstractCegarLoop]: Abstraction has 3692 states and 4789 transitions. [2025-01-09 04:34:36,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 04:34:36,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3692 states and 4789 transitions. [2025-01-09 04:34:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-09 04:34:36,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:36,697 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:34:36,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:34:36,697 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:36,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:36,698 INFO L85 PathProgramCache]: Analyzing trace with hash 829666504, now seen corresponding path program 1 times [2025-01-09 04:34:36,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:36,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208940606] [2025-01-09 04:34:36,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:36,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:36,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 04:34:37,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 04:34:37,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:37,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:34:37,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:37,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208940606] [2025-01-09 04:34:37,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208940606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:37,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:37,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:37,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26996584] [2025-01-09 04:34:37,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:37,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:37,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:37,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:37,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:37,420 INFO L87 Difference]: Start difference. First operand 3692 states and 4789 transitions. Second operand has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 04:34:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:39,399 INFO L93 Difference]: Finished difference Result 7513 states and 9731 transitions. [2025-01-09 04:34:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:39,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 224 [2025-01-09 04:34:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:39,415 INFO L225 Difference]: With dead ends: 7513 [2025-01-09 04:34:39,415 INFO L226 Difference]: Without dead ends: 3826 [2025-01-09 04:34:39,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:39,429 INFO L435 NwaCegarLoop]: 3509 mSDtfsCounter, 3733 mSDsluCounter, 5440 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3733 SdHoareTripleChecker+Valid, 8949 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:39,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3733 Valid, 8949 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 04:34:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3826 states. [2025-01-09 04:34:39,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 3688. [2025-01-09 04:34:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3688 states, 3007 states have (on average 1.2164948453608246) internal successors, (3658), 3052 states have internal predecessors, (3658), 562 states have call successors, (562), 118 states have call predecessors, (562), 118 states have return successors, (561), 541 states have call predecessors, (561), 561 states have call successors, (561) [2025-01-09 04:34:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 4781 transitions. [2025-01-09 04:34:39,531 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 4781 transitions. Word has length 224 [2025-01-09 04:34:39,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:39,532 INFO L471 AbstractCegarLoop]: Abstraction has 3688 states and 4781 transitions. [2025-01-09 04:34:39,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 04:34:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 4781 transitions. [2025-01-09 04:34:39,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 04:34:39,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:39,534 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:34:39,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:34:39,534 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:39,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:39,535 INFO L85 PathProgramCache]: Analyzing trace with hash -2138088427, now seen corresponding path program 1 times [2025-01-09 04:34:39,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:39,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140484491] [2025-01-09 04:34:39,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:39,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:39,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 04:34:39,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 04:34:39,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:39,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 04:34:40,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:40,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140484491] [2025-01-09 04:34:40,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140484491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:40,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:40,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:40,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760573744] [2025-01-09 04:34:40,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:40,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:40,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:40,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:40,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:40,200 INFO L87 Difference]: Start difference. First operand 3688 states and 4781 transitions. Second operand has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 04:34:42,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:42,454 INFO L93 Difference]: Finished difference Result 7369 states and 9563 transitions. [2025-01-09 04:34:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:42,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 225 [2025-01-09 04:34:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:42,487 INFO L225 Difference]: With dead ends: 7369 [2025-01-09 04:34:42,487 INFO L226 Difference]: Without dead ends: 3686 [2025-01-09 04:34:42,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:42,533 INFO L435 NwaCegarLoop]: 3487 mSDtfsCounter, 5742 mSDsluCounter, 4481 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5742 SdHoareTripleChecker+Valid, 7968 SdHoareTripleChecker+Invalid, 2655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 2106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:42,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5742 Valid, 7968 Invalid, 2655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 2106 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 04:34:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2025-01-09 04:34:42,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3684. [2025-01-09 04:34:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3684 states, 3005 states have (on average 1.2159733777038269) internal successors, (3654), 3050 states have internal predecessors, (3654), 560 states have call successors, (560), 118 states have call predecessors, (560), 118 states have return successors, (559), 539 states have call predecessors, (559), 559 states have call successors, (559) [2025-01-09 04:34:42,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3684 states and 4773 transitions. [2025-01-09 04:34:42,804 INFO L78 Accepts]: Start accepts. Automaton has 3684 states and 4773 transitions. Word has length 225 [2025-01-09 04:34:42,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:42,805 INFO L471 AbstractCegarLoop]: Abstraction has 3684 states and 4773 transitions. [2025-01-09 04:34:42,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 04:34:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3684 states and 4773 transitions. [2025-01-09 04:34:42,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 04:34:42,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:42,812 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:34:42,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:34:42,812 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:42,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:42,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1089274875, now seen corresponding path program 1 times [2025-01-09 04:34:42,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:42,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421433581] [2025-01-09 04:34:42,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:42,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:43,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 04:34:43,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 04:34:43,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:43,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 04:34:43,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:43,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421433581] [2025-01-09 04:34:43,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421433581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:43,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:43,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:43,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170403972] [2025-01-09 04:34:43,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:43,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:43,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:43,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:43,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:43,488 INFO L87 Difference]: Start difference. First operand 3684 states and 4773 transitions. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 04:34:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:45,449 INFO L93 Difference]: Finished difference Result 7365 states and 9551 transitions. [2025-01-09 04:34:45,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:45,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 225 [2025-01-09 04:34:45,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:45,462 INFO L225 Difference]: With dead ends: 7365 [2025-01-09 04:34:45,462 INFO L226 Difference]: Without dead ends: 3686 [2025-01-09 04:34:45,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:34:45,474 INFO L435 NwaCegarLoop]: 3381 mSDtfsCounter, 6439 mSDsluCounter, 2578 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 800 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6439 SdHoareTripleChecker+Valid, 5959 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 800 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:45,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6439 Valid, 5959 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [800 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 04:34:45,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2025-01-09 04:34:45,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3684. [2025-01-09 04:34:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3684 states, 3005 states have (on average 1.2156405990016639) internal successors, (3653), 3050 states have internal predecessors, (3653), 560 states have call successors, (560), 118 states have call predecessors, (560), 118 states have return successors, (559), 539 states have call predecessors, (559), 559 states have call successors, (559) [2025-01-09 04:34:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3684 states and 4772 transitions. [2025-01-09 04:34:45,560 INFO L78 Accepts]: Start accepts. Automaton has 3684 states and 4772 transitions. Word has length 225 [2025-01-09 04:34:45,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:45,561 INFO L471 AbstractCegarLoop]: Abstraction has 3684 states and 4772 transitions. [2025-01-09 04:34:45,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 04:34:45,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3684 states and 4772 transitions. [2025-01-09 04:34:45,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-09 04:34:45,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:45,563 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:34:45,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:34:45,564 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:45,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:45,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1863081998, now seen corresponding path program 1 times [2025-01-09 04:34:45,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:45,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951370186] [2025-01-09 04:34:45,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:45,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:45,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 04:34:45,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 04:34:45,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:45,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 04:34:46,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:46,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951370186] [2025-01-09 04:34:46,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951370186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:46,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:46,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:46,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836219949] [2025-01-09 04:34:46,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:46,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:46,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:46,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:46,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:46,129 INFO L87 Difference]: Start difference. First operand 3684 states and 4772 transitions. Second operand has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 4 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 04:34:48,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:48,420 INFO L93 Difference]: Finished difference Result 7497 states and 9697 transitions. [2025-01-09 04:34:48,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:48,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 4 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 228 [2025-01-09 04:34:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:48,436 INFO L225 Difference]: With dead ends: 7497 [2025-01-09 04:34:48,436 INFO L226 Difference]: Without dead ends: 3818 [2025-01-09 04:34:48,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:48,451 INFO L435 NwaCegarLoop]: 3610 mSDtfsCounter, 5797 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5797 SdHoareTripleChecker+Valid, 8176 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:48,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5797 Valid, 8176 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 04:34:48,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2025-01-09 04:34:48,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 3682. [2025-01-09 04:34:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3004 states have (on average 1.2153794940079894) internal successors, (3651), 3049 states have internal predecessors, (3651), 559 states have call successors, (559), 118 states have call predecessors, (559), 118 states have return successors, (558), 538 states have call predecessors, (558), 558 states have call successors, (558) [2025-01-09 04:34:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4768 transitions. [2025-01-09 04:34:48,555 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4768 transitions. Word has length 228 [2025-01-09 04:34:48,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:48,555 INFO L471 AbstractCegarLoop]: Abstraction has 3682 states and 4768 transitions. [2025-01-09 04:34:48,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 4 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 04:34:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4768 transitions. [2025-01-09 04:34:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 04:34:48,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:48,558 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:34:48,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:34:48,558 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:48,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:48,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1977354724, now seen corresponding path program 1 times [2025-01-09 04:34:48,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:48,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887635815] [2025-01-09 04:34:48,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:48,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:48,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 04:34:48,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 04:34:48,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:48,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:49,219 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 04:34:49,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:49,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887635815] [2025-01-09 04:34:49,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887635815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:49,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:49,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:49,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909161095] [2025-01-09 04:34:49,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:49,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:49,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:49,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:49,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:49,221 INFO L87 Difference]: Start difference. First operand 3682 states and 4768 transitions. Second operand has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 4 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 04:34:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:51,191 INFO L93 Difference]: Finished difference Result 7493 states and 9689 transitions. [2025-01-09 04:34:51,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:51,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 4 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 229 [2025-01-09 04:34:51,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:51,206 INFO L225 Difference]: With dead ends: 7493 [2025-01-09 04:34:51,206 INFO L226 Difference]: Without dead ends: 3816 [2025-01-09 04:34:51,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:51,219 INFO L435 NwaCegarLoop]: 3501 mSDtfsCounter, 5702 mSDsluCounter, 4541 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5702 SdHoareTripleChecker+Valid, 8042 SdHoareTripleChecker+Invalid, 2527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:51,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5702 Valid, 8042 Invalid, 2527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 04:34:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2025-01-09 04:34:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 3678. [2025-01-09 04:34:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3678 states, 3002 states have (on average 1.2148567621585609) internal successors, (3647), 3047 states have internal predecessors, (3647), 557 states have call successors, (557), 118 states have call predecessors, (557), 118 states have return successors, (556), 536 states have call predecessors, (556), 556 states have call successors, (556) [2025-01-09 04:34:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 4760 transitions. [2025-01-09 04:34:51,312 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 4760 transitions. Word has length 229 [2025-01-09 04:34:51,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:51,313 INFO L471 AbstractCegarLoop]: Abstraction has 3678 states and 4760 transitions. [2025-01-09 04:34:51,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 4 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 04:34:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4760 transitions. [2025-01-09 04:34:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 04:34:51,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:51,316 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:34:51,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:34:51,316 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:51,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:51,316 INFO L85 PathProgramCache]: Analyzing trace with hash -479203884, now seen corresponding path program 1 times [2025-01-09 04:34:51,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:51,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411863718] [2025-01-09 04:34:51,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:51,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:51,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 04:34:51,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 04:34:51,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:51,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 04:34:51,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:51,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411863718] [2025-01-09 04:34:51,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411863718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:51,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:51,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:51,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013317636] [2025-01-09 04:34:51,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:51,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:51,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:51,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:51,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:51,970 INFO L87 Difference]: Start difference. First operand 3678 states and 4760 transitions. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 4 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 04:34:54,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:54,044 INFO L93 Difference]: Finished difference Result 7349 states and 9521 transitions. [2025-01-09 04:34:54,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:54,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 4 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 230 [2025-01-09 04:34:54,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:54,059 INFO L225 Difference]: With dead ends: 7349 [2025-01-09 04:34:54,059 INFO L226 Difference]: Without dead ends: 3676 [2025-01-09 04:34:54,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:54,073 INFO L435 NwaCegarLoop]: 3479 mSDtfsCounter, 5725 mSDsluCounter, 4473 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5725 SdHoareTripleChecker+Valid, 7952 SdHoareTripleChecker+Invalid, 2642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:54,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5725 Valid, 7952 Invalid, 2642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2098 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 04:34:54,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2025-01-09 04:34:54,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3674. [2025-01-09 04:34:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3674 states, 3000 states have (on average 1.2143333333333333) internal successors, (3643), 3045 states have internal predecessors, (3643), 555 states have call successors, (555), 118 states have call predecessors, (555), 118 states have return successors, (554), 534 states have call predecessors, (554), 554 states have call successors, (554) [2025-01-09 04:34:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3674 states to 3674 states and 4752 transitions. [2025-01-09 04:34:54,168 INFO L78 Accepts]: Start accepts. Automaton has 3674 states and 4752 transitions. Word has length 230 [2025-01-09 04:34:54,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:54,168 INFO L471 AbstractCegarLoop]: Abstraction has 3674 states and 4752 transitions. [2025-01-09 04:34:54,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 4 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 04:34:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3674 states and 4752 transitions. [2025-01-09 04:34:54,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 04:34:54,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:54,172 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:34:54,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:34:54,172 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:54,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash -678715963, now seen corresponding path program 1 times [2025-01-09 04:34:54,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:54,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152355634] [2025-01-09 04:34:54,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:54,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:54,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 04:34:54,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 04:34:54,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:54,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 04:34:54,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:54,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152355634] [2025-01-09 04:34:54,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152355634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:54,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:54,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:34:54,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613716345] [2025-01-09 04:34:54,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:54,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:54,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:54,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:54,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:34:54,778 INFO L87 Difference]: Start difference. First operand 3674 states and 4752 transitions. Second operand has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 04:34:55,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:55,281 INFO L93 Difference]: Finished difference Result 7345 states and 9508 transitions. [2025-01-09 04:34:55,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:34:55,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 230 [2025-01-09 04:34:55,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:55,295 INFO L225 Difference]: With dead ends: 7345 [2025-01-09 04:34:55,295 INFO L226 Difference]: Without dead ends: 3676 [2025-01-09 04:34:55,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:55,308 INFO L435 NwaCegarLoop]: 2937 mSDtfsCounter, 1003 mSDsluCounter, 7755 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 10692 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:55,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 10692 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:34:55,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2025-01-09 04:34:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3674. [2025-01-09 04:34:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3674 states, 3000 states have (on average 1.214) internal successors, (3642), 3045 states have internal predecessors, (3642), 555 states have call successors, (555), 118 states have call predecessors, (555), 118 states have return successors, (554), 534 states have call predecessors, (554), 554 states have call successors, (554) [2025-01-09 04:34:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3674 states to 3674 states and 4751 transitions. [2025-01-09 04:34:55,396 INFO L78 Accepts]: Start accepts. Automaton has 3674 states and 4751 transitions. Word has length 230 [2025-01-09 04:34:55,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:55,397 INFO L471 AbstractCegarLoop]: Abstraction has 3674 states and 4751 transitions. [2025-01-09 04:34:55,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 04:34:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3674 states and 4751 transitions. [2025-01-09 04:34:55,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-01-09 04:34:55,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:55,399 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:34:55,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:34:55,400 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:55,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:55,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1867703998, now seen corresponding path program 1 times [2025-01-09 04:34:55,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:55,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101218217] [2025-01-09 04:34:55,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:55,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:55,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-01-09 04:34:55,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-01-09 04:34:55,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:55,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 04:34:55,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:55,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101218217] [2025-01-09 04:34:55,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101218217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:55,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:55,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:34:55,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573724821] [2025-01-09 04:34:55,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:55,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:55,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:55,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:55,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:34:55,975 INFO L87 Difference]: Start difference. First operand 3674 states and 4751 transitions. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 04:34:56,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:56,492 INFO L93 Difference]: Finished difference Result 7477 states and 9654 transitions. [2025-01-09 04:34:56,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:56,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 233 [2025-01-09 04:34:56,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:56,507 INFO L225 Difference]: With dead ends: 7477 [2025-01-09 04:34:56,507 INFO L226 Difference]: Without dead ends: 3808 [2025-01-09 04:34:56,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:56,519 INFO L435 NwaCegarLoop]: 3013 mSDtfsCounter, 2387 mSDsluCounter, 5664 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2387 SdHoareTripleChecker+Valid, 8677 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:56,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2387 Valid, 8677 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:34:56,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3808 states. [2025-01-09 04:34:56,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3808 to 3672. [2025-01-09 04:34:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3672 states, 2999 states have (on average 1.2137379126375458) internal successors, (3640), 3044 states have internal predecessors, (3640), 554 states have call successors, (554), 118 states have call predecessors, (554), 118 states have return successors, (553), 533 states have call predecessors, (553), 553 states have call successors, (553) [2025-01-09 04:34:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 4747 transitions. [2025-01-09 04:34:56,694 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 4747 transitions. Word has length 233 [2025-01-09 04:34:56,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:56,694 INFO L471 AbstractCegarLoop]: Abstraction has 3672 states and 4747 transitions. [2025-01-09 04:34:56,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 04:34:56,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 4747 transitions. [2025-01-09 04:34:56,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 04:34:56,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:56,697 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:34:56,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:34:56,697 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:56,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:56,698 INFO L85 PathProgramCache]: Analyzing trace with hash -653241803, now seen corresponding path program 1 times [2025-01-09 04:34:56,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:56,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583754090] [2025-01-09 04:34:56,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:56,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:56,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 04:34:57,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 04:34:57,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:57,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 04:34:57,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:57,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583754090] [2025-01-09 04:34:57,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583754090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:57,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:57,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:34:57,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084460102] [2025-01-09 04:34:57,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:57,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:57,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:57,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:57,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:34:57,278 INFO L87 Difference]: Start difference. First operand 3672 states and 4747 transitions. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 04:34:58,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:58,259 INFO L93 Difference]: Finished difference Result 7475 states and 9647 transitions. [2025-01-09 04:34:58,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:58,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 234 [2025-01-09 04:34:58,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:58,275 INFO L225 Difference]: With dead ends: 7475 [2025-01-09 04:34:58,275 INFO L226 Difference]: Without dead ends: 3808 [2025-01-09 04:34:58,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:58,289 INFO L435 NwaCegarLoop]: 2918 mSDtfsCounter, 4460 mSDsluCounter, 4045 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4460 SdHoareTripleChecker+Valid, 6963 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 535 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:58,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4460 Valid, 6963 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [535 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:34:58,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3808 states. [2025-01-09 04:34:58,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3808 to 3670. [2025-01-09 04:34:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3670 states, 2998 states have (on average 1.2134756504336224) internal successors, (3638), 3043 states have internal predecessors, (3638), 553 states have call successors, (553), 118 states have call predecessors, (553), 118 states have return successors, (552), 532 states have call predecessors, (552), 552 states have call successors, (552) [2025-01-09 04:34:58,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 4743 transitions. [2025-01-09 04:34:58,378 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 4743 transitions. Word has length 234 [2025-01-09 04:34:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:58,379 INFO L471 AbstractCegarLoop]: Abstraction has 3670 states and 4743 transitions. [2025-01-09 04:34:58,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 04:34:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 4743 transitions. [2025-01-09 04:34:58,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-01-09 04:34:58,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:58,382 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:34:58,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:34:58,382 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:58,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:58,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1379546332, now seen corresponding path program 1 times [2025-01-09 04:34:58,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:58,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743130310] [2025-01-09 04:34:58,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:58,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:58,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-09 04:34:58,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-09 04:34:58,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:58,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 04:34:59,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:59,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743130310] [2025-01-09 04:34:59,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743130310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:59,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:59,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:34:59,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334401734] [2025-01-09 04:34:59,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:59,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:59,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:59,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:59,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:34:59,030 INFO L87 Difference]: Start difference. First operand 3670 states and 4743 transitions. Second operand has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 04:34:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:59,977 INFO L93 Difference]: Finished difference Result 7335 states and 9487 transitions. [2025-01-09 04:34:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:59,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 235 [2025-01-09 04:34:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:59,993 INFO L225 Difference]: With dead ends: 7335 [2025-01-09 04:34:59,993 INFO L226 Difference]: Without dead ends: 3670 [2025-01-09 04:35:00,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:35:00,011 INFO L435 NwaCegarLoop]: 3037 mSDtfsCounter, 4484 mSDsluCounter, 4136 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4484 SdHoareTripleChecker+Valid, 7173 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:00,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4484 Valid, 7173 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:35:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2025-01-09 04:35:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3668. [2025-01-09 04:35:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 2997 states have (on average 1.2132132132132132) internal successors, (3636), 3042 states have internal predecessors, (3636), 552 states have call successors, (552), 118 states have call predecessors, (552), 118 states have return successors, (551), 531 states have call predecessors, (551), 551 states have call successors, (551) [2025-01-09 04:35:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 4739 transitions. [2025-01-09 04:35:00,121 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 4739 transitions. Word has length 235 [2025-01-09 04:35:00,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:00,121 INFO L471 AbstractCegarLoop]: Abstraction has 3668 states and 4739 transitions. [2025-01-09 04:35:00,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 04:35:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 4739 transitions. [2025-01-09 04:35:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-01-09 04:35:00,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:00,123 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:35:00,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:35:00,124 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:00,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:00,124 INFO L85 PathProgramCache]: Analyzing trace with hash -590976626, now seen corresponding path program 1 times [2025-01-09 04:35:00,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:00,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249372128] [2025-01-09 04:35:00,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:00,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:00,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-09 04:35:00,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-09 04:35:00,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:00,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:00,805 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 04:35:00,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:00,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249372128] [2025-01-09 04:35:00,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249372128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:00,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:00,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:35:00,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450254840] [2025-01-09 04:35:00,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:00,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:35:00,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:00,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:35:00,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:00,806 INFO L87 Difference]: Start difference. First operand 3668 states and 4739 transitions. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 04:35:01,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:01,449 INFO L93 Difference]: Finished difference Result 7333 states and 9482 transitions. [2025-01-09 04:35:01,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:35:01,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 235 [2025-01-09 04:35:01,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:01,467 INFO L225 Difference]: With dead ends: 7333 [2025-01-09 04:35:01,467 INFO L226 Difference]: Without dead ends: 3670 [2025-01-09 04:35:01,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:35:01,482 INFO L435 NwaCegarLoop]: 2924 mSDtfsCounter, 1754 mSDsluCounter, 5328 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 8252 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:01,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 8252 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:35:01,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2025-01-09 04:35:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3668. [2025-01-09 04:35:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 2997 states have (on average 1.2128795462128796) internal successors, (3635), 3042 states have internal predecessors, (3635), 552 states have call successors, (552), 118 states have call predecessors, (552), 118 states have return successors, (551), 531 states have call predecessors, (551), 551 states have call successors, (551) [2025-01-09 04:35:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 4738 transitions. [2025-01-09 04:35:01,579 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 4738 transitions. Word has length 235 [2025-01-09 04:35:01,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:01,580 INFO L471 AbstractCegarLoop]: Abstraction has 3668 states and 4738 transitions. [2025-01-09 04:35:01,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 04:35:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 4738 transitions. [2025-01-09 04:35:01,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-01-09 04:35:01,582 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:01,582 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:35:01,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:35:01,583 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:01,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:01,583 INFO L85 PathProgramCache]: Analyzing trace with hash 680094405, now seen corresponding path program 1 times [2025-01-09 04:35:01,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:01,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290283615] [2025-01-09 04:35:01,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:01,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:01,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-09 04:35:01,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-09 04:35:01,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:01,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 04:35:02,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:02,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290283615] [2025-01-09 04:35:02,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290283615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:02,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:02,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:35:02,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755476710] [2025-01-09 04:35:02,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:02,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:35:02,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:02,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:35:02,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:02,154 INFO L87 Difference]: Start difference. First operand 3668 states and 4738 transitions. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:35:03,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:03,206 INFO L93 Difference]: Finished difference Result 7465 states and 9628 transitions. [2025-01-09 04:35:03,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:35:03,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 238 [2025-01-09 04:35:03,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:03,222 INFO L225 Difference]: With dead ends: 7465 [2025-01-09 04:35:03,222 INFO L226 Difference]: Without dead ends: 3802 [2025-01-09 04:35:03,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:35:03,235 INFO L435 NwaCegarLoop]: 3000 mSDtfsCounter, 4280 mSDsluCounter, 4322 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4280 SdHoareTripleChecker+Valid, 7322 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:03,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4280 Valid, 7322 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:35:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2025-01-09 04:35:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 3666. [2025-01-09 04:35:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 2996 states have (on average 1.2126168224299065) internal successors, (3633), 3041 states have internal predecessors, (3633), 551 states have call successors, (551), 118 states have call predecessors, (551), 118 states have return successors, (550), 530 states have call predecessors, (550), 550 states have call successors, (550) [2025-01-09 04:35:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 4734 transitions. [2025-01-09 04:35:03,427 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 4734 transitions. Word has length 238 [2025-01-09 04:35:03,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:03,428 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 4734 transitions. [2025-01-09 04:35:03,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:35:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 4734 transitions. [2025-01-09 04:35:03,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-01-09 04:35:03,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:03,431 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:35:03,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:35:03,432 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:03,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:03,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1841600878, now seen corresponding path program 1 times [2025-01-09 04:35:03,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:03,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367335874] [2025-01-09 04:35:03,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:03,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:03,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-01-09 04:35:03,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-01-09 04:35:03,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:03,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:04,003 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 04:35:04,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:04,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367335874] [2025-01-09 04:35:04,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367335874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:04,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:04,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:35:04,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024138808] [2025-01-09 04:35:04,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:04,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:35:04,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:04,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:35:04,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:04,005 INFO L87 Difference]: Start difference. First operand 3666 states and 4734 transitions. Second operand has 5 states, 5 states have (on average 39.2) internal successors, (196), 5 states have internal predecessors, (196), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:35:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:04,824 INFO L93 Difference]: Finished difference Result 7463 states and 9621 transitions. [2025-01-09 04:35:04,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:35:04,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.2) internal successors, (196), 5 states have internal predecessors, (196), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 239 [2025-01-09 04:35:04,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:04,842 INFO L225 Difference]: With dead ends: 7463 [2025-01-09 04:35:04,843 INFO L226 Difference]: Without dead ends: 3802 [2025-01-09 04:35:04,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:35:04,856 INFO L435 NwaCegarLoop]: 2905 mSDtfsCounter, 4425 mSDsluCounter, 4031 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4425 SdHoareTripleChecker+Valid, 6936 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:04,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4425 Valid, 6936 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [528 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:35:04,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2025-01-09 04:35:04,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 3664. [2025-01-09 04:35:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3664 states, 2995 states have (on average 1.2123539232053422) internal successors, (3631), 3040 states have internal predecessors, (3631), 550 states have call successors, (550), 118 states have call predecessors, (550), 118 states have return successors, (549), 529 states have call predecessors, (549), 549 states have call successors, (549) [2025-01-09 04:35:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3664 states to 3664 states and 4730 transitions. [2025-01-09 04:35:04,944 INFO L78 Accepts]: Start accepts. Automaton has 3664 states and 4730 transitions. Word has length 239 [2025-01-09 04:35:04,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:04,945 INFO L471 AbstractCegarLoop]: Abstraction has 3664 states and 4730 transitions. [2025-01-09 04:35:04,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.2) internal successors, (196), 5 states have internal predecessors, (196), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:35:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3664 states and 4730 transitions. [2025-01-09 04:35:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-01-09 04:35:04,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:04,947 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:35:04,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:35:04,947 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:04,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:04,948 INFO L85 PathProgramCache]: Analyzing trace with hash -549137941, now seen corresponding path program 1 times [2025-01-09 04:35:04,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:04,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037050521] [2025-01-09 04:35:04,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:04,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:05,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-01-09 04:35:05,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-01-09 04:35:05,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:05,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 04:35:05,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:05,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037050521] [2025-01-09 04:35:05,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037050521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:05,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:05,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:35:05,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256384660] [2025-01-09 04:35:05,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:05,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:35:05,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:05,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:35:05,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:05,759 INFO L87 Difference]: Start difference. First operand 3664 states and 4730 transitions. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:35:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:06,924 INFO L93 Difference]: Finished difference Result 7323 states and 9461 transitions. [2025-01-09 04:35:06,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:35:06,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 240 [2025-01-09 04:35:06,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:06,941 INFO L225 Difference]: With dead ends: 7323 [2025-01-09 04:35:06,941 INFO L226 Difference]: Without dead ends: 3664 [2025-01-09 04:35:06,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:35:06,956 INFO L435 NwaCegarLoop]: 3024 mSDtfsCounter, 4449 mSDsluCounter, 4122 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4449 SdHoareTripleChecker+Valid, 7146 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:06,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4449 Valid, 7146 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:35:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2025-01-09 04:35:07,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 3662. [2025-01-09 04:35:07,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 2994 states have (on average 1.2120908483633934) internal successors, (3629), 3039 states have internal predecessors, (3629), 549 states have call successors, (549), 118 states have call predecessors, (549), 118 states have return successors, (548), 528 states have call predecessors, (548), 548 states have call successors, (548) [2025-01-09 04:35:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 4726 transitions. [2025-01-09 04:35:07,073 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 4726 transitions. Word has length 240 [2025-01-09 04:35:07,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:07,074 INFO L471 AbstractCegarLoop]: Abstraction has 3662 states and 4726 transitions. [2025-01-09 04:35:07,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:35:07,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 4726 transitions. [2025-01-09 04:35:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-01-09 04:35:07,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:07,077 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:35:07,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:35:07,077 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:07,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:07,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2101043483, now seen corresponding path program 1 times [2025-01-09 04:35:07,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:07,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577581509] [2025-01-09 04:35:07,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:07,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:07,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-01-09 04:35:07,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-01-09 04:35:07,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:07,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 04:35:07,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:07,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577581509] [2025-01-09 04:35:07,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577581509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:07,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:07,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:35:07,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76022467] [2025-01-09 04:35:07,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:07,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:35:07,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:07,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:35:07,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:35:07,743 INFO L87 Difference]: Start difference. First operand 3662 states and 4726 transitions. Second operand has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:35:09,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:09,649 INFO L93 Difference]: Finished difference Result 7319 states and 9455 transitions. [2025-01-09 04:35:09,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:35:09,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 240 [2025-01-09 04:35:09,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:09,666 INFO L225 Difference]: With dead ends: 7319 [2025-01-09 04:35:09,666 INFO L226 Difference]: Without dead ends: 3662 [2025-01-09 04:35:09,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:35:09,676 INFO L435 NwaCegarLoop]: 3449 mSDtfsCounter, 6542 mSDsluCounter, 2621 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 823 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6542 SdHoareTripleChecker+Valid, 6070 SdHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 823 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:09,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6542 Valid, 6070 Invalid, 2201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [823 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 04:35:09,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2025-01-09 04:35:09,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3660. [2025-01-09 04:35:09,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3660 states, 2993 states have (on average 1.2118275977280322) internal successors, (3627), 3038 states have internal predecessors, (3627), 548 states have call successors, (548), 118 states have call predecessors, (548), 118 states have return successors, (547), 527 states have call predecessors, (547), 547 states have call successors, (547) [2025-01-09 04:35:09,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 4722 transitions. [2025-01-09 04:35:09,780 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 4722 transitions. Word has length 240 [2025-01-09 04:35:09,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:09,781 INFO L471 AbstractCegarLoop]: Abstraction has 3660 states and 4722 transitions. [2025-01-09 04:35:09,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 04:35:09,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 4722 transitions. [2025-01-09 04:35:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-01-09 04:35:09,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:09,783 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:35:09,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:35:09,783 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:09,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:09,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1817397042, now seen corresponding path program 1 times [2025-01-09 04:35:09,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:09,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590244233] [2025-01-09 04:35:09,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:09,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms