./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekcba_nxt.3.M1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/rekcba_nxt.3.M1.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 d1acaf5881e7bc6fb96063443cb57a4aeaaabd457c070b840e9f79d5e20a5abf --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:18:05,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:18:05,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:18:05,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:18:05,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:18:05,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:18:05,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:18:05,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:18:05,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:18:05,716 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:18:05,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:18:05,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:18:05,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:18:05,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:18:05,717 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:18:05,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:18:05,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:18:05,717 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:18:05,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:18:05,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:18:05,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:18:05,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:18:05,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:18:05,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:18:05,718 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:18:05,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:18:05,718 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:18:05,718 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:18:05,718 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:18:05,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:18:05,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:18:05,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:18:05,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:18:05,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:18:05,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:18:05,719 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:18:05,719 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:18:05,719 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:18:05,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:18:05,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:18:05,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:18:05,719 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:18:05,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:18:05,719 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 -> d1acaf5881e7bc6fb96063443cb57a4aeaaabd457c070b840e9f79d5e20a5abf [2025-02-07 21:18:05,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:18:05,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:18:05,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:18:05,957 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:18:05,957 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:18:05,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekcba_nxt.3.M1.c [2025-02-07 21:18:07,056 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ac80b1cf/75d0e716563b4909b131916de9a0e0f8/FLAG0ca514291 [2025-02-07 21:18:07,393 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:18:07,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekcba_nxt.3.M1.c [2025-02-07 21:18:07,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ac80b1cf/75d0e716563b4909b131916de9a0e0f8/FLAG0ca514291 [2025-02-07 21:18:07,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ac80b1cf/75d0e716563b4909b131916de9a0e0f8 [2025-02-07 21:18:07,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:18:07,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:18:07,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:18:07,438 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:18:07,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:18:07,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:18:07" (1/1) ... [2025-02-07 21:18:07,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@416d68ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:18:07, skipping insertion in model container [2025-02-07 21:18:07,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:18:07" (1/1) ... [2025-02-07 21:18:07,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:18:07,632 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/rekcba_nxt.3.M1.c[2017,2030] [2025-02-07 21:18:07,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:18:07,923 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:18:07,930 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/nxt.ok3.i","-S") [47] [2025-02-07 21:18:07,935 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/rekcba_nxt.3.M1.c[2017,2030] [2025-02-07 21:18:08,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:18:08,150 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:18:08,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:18:08 WrapperNode [2025-02-07 21:18:08,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:18:08,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:18:08,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:18:08,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:18:08,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:18:08" (1/1) ... [2025-02-07 21:18:08,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:18:08" (1/1) ... [2025-02-07 21:18:08,330 INFO L138 Inliner]: procedures = 63, calls = 2139, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 4505 [2025-02-07 21:18:08,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:18:08,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:18:08,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:18:08,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:18:08,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:18:08" (1/1) ... [2025-02-07 21:18:08,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:18:08" (1/1) ... [2025-02-07 21:18:08,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:18:08" (1/1) ... [2025-02-07 21:18:08,437 INFO L175 MemorySlicer]: Split 1626 memory accesses to 22 slices as follows [2, 8, 50, 5, 3, 264, 305, 156, 113, 79, 2, 57, 8, 82, 105, 82, 105, 82, 105, 2, 4, 7]. 19 percent of accesses are in the largest equivalence class. The 223 initializations are split as follows [2, 0, 0, 2, 1, 24, 24, 2, 2, 1, 0, 1, 0, 27, 27, 27, 27, 27, 27, 0, 0, 2]. The 257 writes are split as follows [0, 4, 26, 1, 1, 24, 24, 2, 2, 1, 1, 1, 4, 28, 26, 28, 26, 28, 26, 1, 0, 3]. [2025-02-07 21:18:08,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:18:08" (1/1) ... [2025-02-07 21:18:08,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:18:08" (1/1) ... [2025-02-07 21:18:08,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:18:08" (1/1) ... [2025-02-07 21:18:08,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:18:08" (1/1) ... [2025-02-07 21:18:08,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:18:08" (1/1) ... [2025-02-07 21:18:08,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:18:08" (1/1) ... [2025-02-07 21:18:08,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:18:08,635 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:18:08,635 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:18:08,636 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:18:08,636 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:18:08" (1/1) ... [2025-02-07 21:18:08,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:18:08,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:18:08,670 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-02-07 21:18:08,678 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-02-07 21:18:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:18:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-02-07 21:18:08,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-02-07 21:18:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_nxtway_gs_mode [2025-02-07 21:18:08,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_nxtway_gs_mode [2025-02-07 21:18:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-07 21:18:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-07 21:18:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-07 21:18:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-07 21:18:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-07 21:18:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-07 21:18:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-07 21:18:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-07 21:18:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-07 21:18:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-07 21:18:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-07 21:18:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-07 21:18:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-07 21:18:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-07 21:18:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-07 21:18:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-07 21:18:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-07 21:18:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-07 21:18:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-07 21:18:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-07 21:18:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-07 21:18:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-02-07 21:18:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:18:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-02-07 21:18:08,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-02-07 21:18:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-02-07 21:18:08,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-02-07 21:18:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_observer_obstacle_flag [2025-02-07 21:18:08,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_observer_obstacle_flag [2025-02-07 21:18:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_obstacle_flag [2025-02-07 21:18:08,698 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_obstacle_flag [2025-02-07 21:18:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:18:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:18:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:18:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 21:18:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 21:18:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 21:18:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 21:18:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 21:18:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 21:18:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-02-07 21:18:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_gyro_sensor [2025-02-07 21:18:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_gyro_sensor [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-02-07 21:18:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts1 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-02-07 21:18:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_ts2 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_OSEK_Task_Background [2025-02-07 21:18:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_OSEK_Task_Background [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 21:18:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-02-07 21:18:08,700 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_speed [2025-02-07 21:18:08,700 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_speed [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_obstacle_flag [2025-02-07 21:18:08,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_obstacle_flag [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 21:18:08,700 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 21:18:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 21:18:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 21:18:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 21:18:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 21:18:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 21:18:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 21:18:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-07 21:18:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-07 21:18:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-07 21:18:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-07 21:18:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-07 21:18:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-07 21:18:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-07 21:18:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:18:08,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:18:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_systick_ms [2025-02-07 21:18:08,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_systick_ms [2025-02-07 21:18:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-02-07 21:18:08,704 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-02-07 21:18:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtway_gs_mode [2025-02-07 21:18:08,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtway_gs_mode [2025-02-07 21:18:09,057 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:18:09,059 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:18:09,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2009-1: assume __startrek_read_observer_obstacle_flag_#t~switch1335#1;__startrek_read_observer_obstacle_flag_~or3~2#1 := ~__startrek_round~0; [2025-02-07 21:18:09,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2009-1: assume !__startrek_read_observer_obstacle_flag_#t~switch1335#1;havoc __startrek_read_observer_obstacle_flag_#t~switch1335#1;havoc __startrek_read_observer_obstacle_flag_#t~switch1335#1;call __startrek_read_observer_obstacle_flag_#t~mem1339#1 := read~int#17(~#_observer_obstacle_flag_~0.base, ~#_observer_obstacle_flag_~0.offset + (if ~__startrek_round~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_round~0 % 256 % 4294967296 else ~__startrek_round~0 % 256 % 4294967296 - 4294967296), 1);__startrek_read_observer_obstacle_flag_~r1~2#1 := (if 0 == __startrek_read_observer_obstacle_flag_#t~mem1339#1 % 256 then 0 else 1);havoc __startrek_read_observer_obstacle_flag_#t~mem1339#1;__startrek_read_observer_obstacle_flag_#res#1 := (if 0 == __startrek_read_observer_obstacle_flag_~r1~2#1 % 256 then 0 else 1); [2025-02-07 21:18:09,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: balance_control_~tmp_pwm_r_limiter~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT((~K_I~0 * ~ud_err_theta~0 + balance_control_~tmp_pwm_r_limiter~0#1) % 4294967296 / ((~BATTERY_GAIN~0 * balance_control_~args_battery#1 - ~BATTERY_OFFSET~0) % 4294967296)), 100.0));balance_control_~tmp_pwm_turn~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(balance_control_~args_cmd_turn#1), 100.0), ~convertUINTToFLOAT(~K_PHIDOT~0)));balance_control_~tmp_pwm_l_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 + balance_control_~tmp_pwm_turn~0#1;havoc balance_control_#t~nondet20#1;assume -2147483648 <= balance_control_#t~nondet20#1 && balance_control_#t~nondet20#1 <= 2147483647;balance_control_~tmp___0~0#1 := balance_control_#t~nondet20#1;havoc balance_control_#t~nondet20#1;balance_control_~tmp_pwm_l_limiter~0#1 := balance_control_~tmp___0~0#1;call write~int#19((if balance_control_~tmp_pwm_l_limiter~0#1 % 4294967296 % 256 <= 127 then balance_control_~tmp_pwm_l_limiter~0#1 % 4294967296 % 256 else balance_control_~tmp_pwm_l_limiter~0#1 % 4294967296 % 256 - 256), balance_control_~ret_pwm_l#1.base, balance_control_~ret_pwm_l#1.offset, 1);balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 - balance_control_~tmp_pwm_turn~0#1;havoc balance_control_#t~nondet21#1;assume -2147483648 <= balance_control_#t~nondet21#1 && balance_control_#t~nondet21#1 <= 2147483647;balance_control_~tmp___1~0#1 := balance_control_#t~nondet21#1;havoc balance_control_#t~nondet21#1;balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp___1~0#1;call write~int#10((if balance_control_~tmp_pwm_r_limiter~0#1 % 4294967296 % 256 <= 127 then balance_control_~tmp_pwm_r_limiter~0#1 % 4294967296 % 256 else balance_control_~tmp_pwm_r_limiter~0#1 % 4294967296 % 256 - 256), balance_control_~ret_pwm_r#1.base, balance_control_~ret_pwm_r#1.offset, 1);balance_control_~tmp_pwm_l_limiter~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.00400000019, ~convertUINTToFLOAT(balance_control_~tmp_thetadot_cmd_lpf~0#1)), ~convertUINTToFLOAT(~ud_theta_ref~0)));balance_control_~tmp_pwm_turn~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.00400000019, ~convertUINTToFLOAT(balance_control_~tmp_psidot~0#1)), ~convertUINTToFLOAT(~ud_psi~0)));balance_control_~tmp_pwm_r_limiter~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(~ud_theta_ref~0 - balance_control_~tmp_theta~0#1), 0.00400000019), ~convertUINTToFLOAT(~ud_err_theta~0)));~ud_err_theta~0 := balance_control_~tmp_pwm_r_limiter~0#1;~ud_theta_ref~0 := balance_control_~tmp_pwm_l_limiter~0#1;~ud_thetadot_cmd_lpf~0 := balance_control_~tmp_thetadot_cmd_lpf~0#1;~ud_psi~0 := balance_control_~tmp_pwm_turn~0#1;~ud_theta_lpf~0 := balance_control_~tmp_theta_lpf~0#1;call ULTIMATE.dealloc(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset);havoc balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset;call ULTIMATE.dealloc(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset);havoc balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset; [2025-02-07 21:18:09,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L118-1: SUMMARY for call assume_abort_if_not((if 0 != (~BATTERY_GAIN~0 * balance_control_~args_battery#1 - ~BATTERY_OFFSET~0) % 4294967296 then 1 else 0)); srcloc: null [2025-02-07 21:18:09,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: OSEK_Task_ts1_#t~ret42#1 := __startrek_read_observer_obstacle_flag_#res#1;havoc __startrek_read_observer_obstacle_flag_#t~switch1335#1, __startrek_read_observer_obstacle_flag_#t~ret1336#1, __startrek_read_observer_obstacle_flag_#t~ret1337#1, __startrek_read_observer_obstacle_flag_#t~ret1338#1, __startrek_read_observer_obstacle_flag_#t~mem1339#1, __startrek_read_observer_obstacle_flag_~r1~2#1, __startrek_read_observer_obstacle_flag_~c2~2#1, __startrek_read_observer_obstacle_flag_~or3~2#1;assume { :end_inline___startrek_read_observer_obstacle_flag } true;OSEK_Task_ts1_~tmp___3~0#1 := (if 0 == OSEK_Task_ts1_#t~ret42#1 % 256 then 0 else 1); [2025-02-07 21:18:09,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L259: havoc ecrobot_sound_tone_~arg0#1, ecrobot_sound_tone_~arg1#1, ecrobot_sound_tone_~arg2#1;havoc ecrobot_sound_tone_#in~arg0#1, ecrobot_sound_tone_#in~arg1#1, ecrobot_sound_tone_#in~arg2#1;assume { :end_inline_ecrobot_sound_tone } true; [2025-02-07 21:18:09,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L284: call OSEK_Task_ts1_#t~mem50#1 := read~int#10(OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset, 1); [2025-02-07 21:18:09,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L284-1: SUMMARY for call nxt_motor_set_speed(0, OSEK_Task_ts1_#t~mem49#1, 1); srcloc: null [2025-02-07 21:18:09,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1424-1: assume __startrek_assert_i0_#t~switch1060#1;call write~int#2(0, ~#__startrek_Assert_t2_i0~0.base, ~#__startrek_Assert_t2_i0~0.offset + (if ~__startrek_job~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_job~0 % 256 % 4294967296 else ~__startrek_job~0 % 256 % 4294967296 - 4294967296), 1); [2025-02-07 21:18:09,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1424-1: assume !__startrek_assert_i0_#t~switch1060#1;havoc __startrek_assert_i0_#t~switch1060#1;havoc __startrek_assert_i0_#t~switch1060#1;havoc __startrek_assert_i0_#t~switch1060#1, __startrek_assert_i0_~arg#1;havoc __startrek_assert_i0_#in~arg#1;assume { :end_inline___startrek_assert_i0 } true; [2025-02-07 21:18:09,391 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1994: __startrek_read_observer_obstacle_flag_~c2~2#1 := (if 0 == __startrek_read_observer_obstacle_flag_#t~ret1336#1 % 256 then 0 else 1);havoc __startrek_read_observer_obstacle_flag_#t~ret1336#1; [2025-02-07 21:18:09,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1994-1: SUMMARY for call __startrek_read_observer_obstacle_flag_#t~ret1336#1 := __startrek_cs_t0(); srcloc: null [2025-02-07 21:18:09,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L260: SUMMARY for call __startrek_write_nxtway_gs_mode(2); srcloc: null [2025-02-07 21:18:09,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1408: assume 0 != (if ~__startrek_hyper_period~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_hyper_period~0 % 256 % 4294967296 else ~__startrek_hyper_period~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:18:09,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1408: assume !(0 != (if ~__startrek_hyper_period~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_hyper_period~0 % 256 % 4294967296 else ~__startrek_hyper_period~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:18:09,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: assume { :begin_inline_ecrobot_bt_data_logger } true;ecrobot_bt_data_logger_#in~arg0#1, ecrobot_bt_data_logger_#in~arg1#1 := OSEK_Task_ts1_~cmd_forward~0#1, OSEK_Task_ts1_~cmd_turn~0#1;havoc ecrobot_bt_data_logger_~arg0#1, ecrobot_bt_data_logger_~arg1#1;ecrobot_bt_data_logger_~arg0#1 := ecrobot_bt_data_logger_#in~arg0#1;ecrobot_bt_data_logger_~arg1#1 := ecrobot_bt_data_logger_#in~arg1#1; [2025-02-07 21:18:09,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L285-1: SUMMARY for call nxt_motor_set_speed(1, OSEK_Task_ts1_#t~mem50#1, 1); srcloc: null [2025-02-07 21:18:09,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L277: OSEK_Task_ts1_#t~ret45#1 := ecrobot_get_battery_voltage_#res#1;havoc ecrobot_get_battery_voltage_#t~nondet30#1, ecrobot_get_battery_voltage_~tmp~3#1;assume { :end_inline_ecrobot_get_battery_voltage } true;OSEK_Task_ts1_~tmp___5~0#1 := OSEK_Task_ts1_#t~ret45#1; [2025-02-07 21:18:09,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L277-1: assume { :begin_inline_ecrobot_get_battery_voltage } true;havoc ecrobot_get_battery_voltage_#res#1;havoc ecrobot_get_battery_voltage_#t~nondet30#1, ecrobot_get_battery_voltage_~tmp~3#1;havoc ecrobot_get_battery_voltage_~tmp~3#1;havoc ecrobot_get_battery_voltage_#t~nondet30#1;ecrobot_get_battery_voltage_~tmp~3#1 := ecrobot_get_battery_voltage_#t~nondet30#1;havoc ecrobot_get_battery_voltage_#t~nondet30#1;ecrobot_get_battery_voltage_#res#1 := ecrobot_get_battery_voltage_~tmp~3#1; [2025-02-07 21:18:09,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2003: __startrek_read_observer_obstacle_flag_~c2~2#1 := (if 0 == __startrek_read_observer_obstacle_flag_#t~ret1337#1 % 256 then 0 else 1);havoc __startrek_read_observer_obstacle_flag_#t~ret1337#1; [2025-02-07 21:18:09,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2003-1: SUMMARY for call __startrek_read_observer_obstacle_flag_#t~ret1337#1 := __startrek_cs_t1(); srcloc: null [2025-02-07 21:18:09,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L269: OSEK_Task_ts1_~tmp___2~0#1 := (if 0 == OSEK_Task_ts1_#t~ret43#1 % 256 then 0 else 1);havoc OSEK_Task_ts1_#t~ret43#1;assume { :begin_inline___startrek_assert_i0 } true;__startrek_assert_i0_#in~arg#1 := (if 0 == OSEK_Task_ts1_~tmp___2~0#1 % 256 then 0 else 1);havoc __startrek_assert_i0_#t~switch1060#1, __startrek_assert_i0_~arg#1;__startrek_assert_i0_~arg#1 := __startrek_assert_i0_#in~arg#1; [2025-02-07 21:18:09,392 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L269-1: SUMMARY for call OSEK_Task_ts1_#t~ret43#1 := __startrek_read_obstacle_flag(); srcloc: null [2025-02-07 21:18:09,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc ecrobot_bt_data_logger_~arg0#1, ecrobot_bt_data_logger_~arg1#1;havoc ecrobot_bt_data_logger_#in~arg0#1, ecrobot_bt_data_logger_#in~arg1#1;assume { :end_inline_ecrobot_bt_data_logger } true; [2025-02-07 21:18:09,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2012: __startrek_read_observer_obstacle_flag_~c2~2#1 := (if 0 == __startrek_read_observer_obstacle_flag_#t~ret1338#1 % 256 then 0 else 1);havoc __startrek_read_observer_obstacle_flag_#t~ret1338#1; [2025-02-07 21:18:09,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2012-1: SUMMARY for call __startrek_read_observer_obstacle_flag_#t~ret1338#1 := __startrek_cs_t2(); srcloc: null [2025-02-07 21:18:09,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L278: assume -128 <= OSEK_Task_ts1_#t~ret46#1 && OSEK_Task_ts1_#t~ret46#1 <= 127;OSEK_Task_ts1_~tmp___6~0#1 := OSEK_Task_ts1_#t~ret46#1; [2025-02-07 21:18:09,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L278-1: SUMMARY for call OSEK_Task_ts1_#t~ret46#1 := nxt_motor_get_count(1); srcloc: null [2025-02-07 21:18:09,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L245: assume { :end_inline_balance_init } true; [2025-02-07 21:18:09,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1418-1: assume __startrek_assert_i0_#t~switch1060#1;call write~int#4(0, ~#__startrek_Assert_t0_i0~0.base, ~#__startrek_Assert_t0_i0~0.offset + (if ~__startrek_job~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_job~0 % 256 % 4294967296 else ~__startrek_job~0 % 256 % 4294967296 - 4294967296), 1); [2025-02-07 21:18:09,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1418-1: assume !__startrek_assert_i0_#t~switch1060#1;__startrek_assert_i0_#t~switch1060#1 := __startrek_assert_i0_#t~switch1060#1 || 1 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:18:09,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1418-2: __startrek_assert_i0_#t~switch1060#1 := 0 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:18:09,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L221: call ULTIMATE.dealloc(OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset);havoc OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset;call ULTIMATE.dealloc(OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset);havoc OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset; [2025-02-07 21:18:09,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: call ULTIMATE.dealloc(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset);havoc balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset;call ULTIMATE.dealloc(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset);havoc balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset;havoc balance_control_#t~mem4#1, balance_control_#t~mem5#1, balance_control_#t~mem6#1, balance_control_#t~post7#1, balance_control_#t~mem8#1, balance_control_#t~mem9#1, balance_control_#t~mem10#1, balance_control_#t~post11#1, balance_control_#t~mem12#1, balance_control_#t~mem13#1, balance_control_#t~mem14#1, balance_control_#t~post15#1, balance_control_#t~mem16#1, balance_control_#t~mem17#1, balance_control_#t~mem18#1, balance_control_#t~post19#1, balance_control_#t~nondet20#1, balance_control_#t~nondet21#1, balance_control_~args_cmd_forward#1, balance_control_~args_cmd_turn#1, balance_control_~args_gyro#1, balance_control_~args_gyro_offset#1, balance_control_~args_theta_m_l#1, balance_control_~args_theta_m_r#1, balance_control_~args_battery#1, balance_control_~ret_pwm_l#1.base, balance_control_~ret_pwm_l#1.offset, balance_control_~ret_pwm_r#1.base, balance_control_~ret_pwm_r#1.offset, balance_control_~tmp_theta~0#1, balance_control_~tmp_theta_lpf~0#1, balance_control_~tmp_pwm_r_limiter~0#1, balance_control_~tmp_psidot~0#1, balance_control_~tmp_pwm_turn~0#1, balance_control_~tmp_pwm_l_limiter~0#1, balance_control_~tmp_thetadot_cmd_lpf~0#1, balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset, balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset, balance_control_~tmp_0~0#1, balance_control_~tmp___0~0#1, balance_control_~tmp___1~0#1;havoc balance_control_#in~args_cmd_forward#1, balance_control_#in~args_cmd_turn#1, balance_control_#in~args_gyro#1, balance_control_#in~args_gyro_offset#1, balance_control_#in~args_theta_m_l#1, balance_control_#in~args_theta_m_r#1, balance_control_#in~args_battery#1, balance_control_#in~ret_pwm_l#1.base, balance_control_#in~ret_pwm_l#1.offset, balance_control_#in~ret_pwm_r#1.base, balance_control_#in~ret_pwm_r#1.offset;assume { :end_inline_balance_control } true;call OSEK_Task_ts1_#t~mem49#1 := read~int#19(OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset, 1); [2025-02-07 21:18:09,393 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L279: assume -128 <= OSEK_Task_ts1_#t~ret47#1 && OSEK_Task_ts1_#t~ret47#1 <= 127;OSEK_Task_ts1_~tmp___7~0#1 := OSEK_Task_ts1_#t~ret47#1; [2025-02-07 21:18:09,394 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L279-1: SUMMARY for call OSEK_Task_ts1_#t~ret47#1 := nxt_motor_get_count(0); srcloc: null [2025-02-07 21:18:09,394 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L246: SUMMARY for call nxt_motor_set_count(0, 0); srcloc: null [2025-02-07 21:18:09,394 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263-1: assume 0 != OSEK_Task_ts1_~tmp___4~0#1 % 256;OSEK_Task_ts1_~cmd_forward~0#1 := -100;OSEK_Task_ts1_~cmd_turn~0#1 := 0; [2025-02-07 21:18:09,394 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263-1: assume !(0 != OSEK_Task_ts1_~tmp___4~0#1 % 256); [2025-02-07 21:18:09,394 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263-2: assume 0 != OSEK_Task_ts1_~tmp___3~0#1 % 256; [2025-02-07 21:18:09,394 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263-2: assume !(0 != OSEK_Task_ts1_~tmp___3~0#1 % 256); [2025-02-07 21:18:09,394 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1411: assume 0 != __startrek_assert_i0_~arg#1 % 256; [2025-02-07 21:18:09,394 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1411: assume !(0 != __startrek_assert_i0_~arg#1 % 256); [2025-02-07 21:18:09,394 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: OSEK_Task_ts1_~tmp___8~0#1 := OSEK_Task_ts1_#t~ret48#1;assume { :begin_inline_balance_control } true;balance_control_#in~args_cmd_forward#1, balance_control_#in~args_cmd_turn#1, balance_control_#in~args_gyro#1, balance_control_#in~args_gyro_offset#1, balance_control_#in~args_theta_m_l#1, balance_control_#in~args_theta_m_r#1, balance_control_#in~args_battery#1, balance_control_#in~ret_pwm_l#1.base, balance_control_#in~ret_pwm_l#1.offset, balance_control_#in~ret_pwm_r#1.base, balance_control_#in~ret_pwm_r#1.offset := OSEK_Task_ts1_~cmd_forward~0#1, OSEK_Task_ts1_~cmd_turn~0#1, OSEK_Task_ts1_~tmp___8~0#1, ~gyro_offset~0, OSEK_Task_ts1_~tmp___7~0#1, OSEK_Task_ts1_~tmp___6~0#1, OSEK_Task_ts1_~tmp___5~0#1, OSEK_Task_ts1_~#pwm_l~0#1.base, OSEK_Task_ts1_~#pwm_l~0#1.offset, OSEK_Task_ts1_~#pwm_r~0#1.base, OSEK_Task_ts1_~#pwm_r~0#1.offset;havoc balance_control_#t~mem4#1, balance_control_#t~mem5#1, balance_control_#t~mem6#1, balance_control_#t~post7#1, balance_control_#t~mem8#1, balance_control_#t~mem9#1, balance_control_#t~mem10#1, balance_control_#t~post11#1, balance_control_#t~mem12#1, balance_control_#t~mem13#1, balance_control_#t~mem14#1, balance_control_#t~post15#1, balance_control_#t~mem16#1, balance_control_#t~mem17#1, balance_control_#t~mem18#1, balance_control_#t~post19#1, balance_control_#t~nondet20#1, balance_control_#t~nondet21#1, balance_control_~args_cmd_forward#1, balance_control_~args_cmd_turn#1, balance_control_~args_gyro#1, balance_control_~args_gyro_offset#1, balance_control_~args_theta_m_l#1, balance_control_~args_theta_m_r#1, balance_control_~args_battery#1, balance_control_~ret_pwm_l#1.base, balance_control_~ret_pwm_l#1.offset, balance_control_~ret_pwm_r#1.base, balance_control_~ret_pwm_r#1.offset, balance_control_~tmp_theta~0#1, balance_control_~tmp_theta_lpf~0#1, balance_control_~tmp_pwm_r_limiter~0#1, balance_control_~tmp_psidot~0#1, balance_control_~tmp_pwm_turn~0#1, balance_control_~tmp_pwm_l_limiter~0#1, balance_control_~tmp_thetadot_cmd_lpf~0#1, balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset, balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset, balance_control_~tmp_0~0#1, balance_control_~tmp___0~0#1, balance_control_~tmp___1~0#1;balance_control_~args_cmd_forward#1 := balance_control_#in~args_cmd_forward#1;balance_control_~args_cmd_turn#1 := balance_control_#in~args_cmd_turn#1;balance_control_~args_gyro#1 := balance_control_#in~args_gyro#1;balance_control_~args_gyro_offset#1 := balance_control_#in~args_gyro_offset#1;balance_control_~args_theta_m_l#1 := balance_control_#in~args_theta_m_l#1;balance_control_~args_theta_m_r#1 := balance_control_#in~args_theta_m_r#1;balance_control_~args_battery#1 := balance_control_#in~args_battery#1;balance_control_~ret_pwm_l#1.base, balance_control_~ret_pwm_l#1.offset := balance_control_#in~ret_pwm_l#1.base, balance_control_#in~ret_pwm_l#1.offset;balance_control_~ret_pwm_r#1.base, balance_control_~ret_pwm_r#1.offset := balance_control_#in~ret_pwm_r#1.base, balance_control_#in~ret_pwm_r#1.offset;havoc balance_control_~tmp_theta~0#1;havoc balance_control_~tmp_theta_lpf~0#1;havoc balance_control_~tmp_pwm_r_limiter~0#1;havoc balance_control_~tmp_psidot~0#1;havoc balance_control_~tmp_pwm_turn~0#1;havoc balance_control_~tmp_pwm_l_limiter~0#1;havoc balance_control_~tmp_thetadot_cmd_lpf~0#1;call balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset := #Ultimate.allocOnStack(16);call balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset := #Ultimate.allocOnStack(16);havoc balance_control_~tmp_0~0#1;havoc balance_control_~tmp___0~0#1;havoc balance_control_~tmp___1~0#1;balance_control_~tmp_thetadot_cmd_lpf~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(balance_control_~args_cmd_forward#1), 100.0), ~convertUINTToFLOAT(~K_THETADOT~0)), ~someBinaryArithmeticFLOAToperation(1.0, ~convertUINTToFLOAT(~A_R~0))), ~convertUINTToFLOAT(~A_R~0 * ~ud_thetadot_cmd_lpf~0)));balance_control_~tmp_theta~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.01745329238, ~convertUINTToFLOAT(balance_control_~args_theta_m_l#1)), ~convertUINTToFLOAT(~ud_psi~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.01745329238, ~convertUINTToFLOAT(balance_control_~args_theta_m_r#1)), ~convertUINTToFLOAT(~ud_psi~0))), 0.5));balance_control_~tmp_theta_lpf~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(1.0, ~convertUINTToFLOAT(~A_D~0)), ~convertUINTToFLOAT(balance_control_~tmp_theta~0#1)), ~convertUINTToFLOAT(~A_D~0 * ~ud_theta_lpf~0)));balance_control_~tmp_psidot~0#1 := ~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(balance_control_~args_gyro#1 - balance_control_~args_gyro_offset#1), 0.01745329238));call write~int#1(~ud_theta_ref~0, balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset, 4);call write~int#1(~convertFLOATToUINT(0.0), balance_control_~#tmp~0#1.base, 4 + balance_control_~#tmp~0#1.offset, 4);call write~int#1(balance_control_~tmp_thetadot_cmd_lpf~0#1, balance_control_~#tmp~0#1.base, 8 + balance_control_~#tmp~0#1.offset, 4);call write~int#1(~convertFLOATToUINT(0.0), balance_control_~#tmp~0#1.base, 12 + balance_control_~#tmp~0#1.offset, 4);call write~int#12(balance_control_~tmp_theta~0#1, balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset, 4);call write~int#12(~ud_psi~0, balance_control_~#tmp_theta_0~0#1.base, 4 + balance_control_~#tmp_theta_0~0#1.offset, 4);call write~int#12(~convertFLOATToUINT(~someBinaryArithmeticFLOAToperation(~convertUINTToFLOAT(balance_control_~tmp_theta_lpf~0#1 - ~ud_theta_lpf~0), 0.00400000019)), balance_control_~#tmp_theta_0~0#1.base, 8 + balance_control_~#tmp_theta_0~0#1.offset, 4);call write~int#12(balance_control_~tmp_psidot~0#1, balance_control_~#tmp_theta_0~0#1.base, 12 + balance_control_~#tmp_theta_0~0#1.offset, 4);balance_control_~tmp_pwm_r_limiter~0#1 := ~convertFLOATToUINT(0.0);balance_control_~tmp_0~0#1 := 0;call balance_control_#t~mem4#1 := read~int#1(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem5#1 := read~int#12(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem6#1 := read~int#20(~#K_F~0.base, ~#K_F~0.offset + 4 * balance_control_~tmp_0~0#1, 4);balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 + (balance_control_#t~mem4#1 - balance_control_#t~mem5#1) * balance_control_#t~mem6#1;havoc balance_control_#t~mem4#1;havoc balance_control_#t~mem5#1;havoc balance_control_#t~mem6#1;balance_control_#t~post7#1 := balance_control_~tmp_0~0#1;balance_control_~tmp_0~0#1 := 1 + balance_control_#t~post7#1;havoc balance_control_#t~post7#1;call balance_control_#t~mem8#1 := read~int#1(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem9#1 := read~int#12(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem10#1 := read~int#20(~#K_F~0.base, ~#K_F~0.offset + 4 * balance_control_~tmp_0~0#1, 4);balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 + (balance_control_#t~mem8#1 - balance_control_#t~mem9#1) * balance_control_#t~mem10#1;havoc balance_control_#t~mem8#1;havoc balance_control_#t~mem9#1;havoc balance_control_#t~mem10#1;balance_control_#t~post11#1 := balance_control_~tmp_0~0#1;balance_control_~tmp_0~0#1 := 1 + balance_control_#t~post11#1;havoc balance_control_#t~post11#1;call balance_control_#t~mem12#1 := read~int#1(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem13#1 := read~int#12(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem14#1 := read~int#20(~#K_F~0.base, ~#K_F~0.offset + 4 * balance_control_~tmp_0~0#1, 4);balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 + (balance_control_#t~mem12#1 - balance_control_#t~mem13#1) * balance_control_#t~mem14#1;havoc balance_control_#t~mem12#1;havoc balance_control_#t~mem13#1;havoc balance_control_#t~mem14#1;balance_control_#t~post15#1 := balance_control_~tmp_0~0#1;balance_control_~tmp_0~0#1 := 1 + balance_control_#t~post15#1;havoc balance_control_#t~post15#1;call balance_control_#t~mem16#1 := read~int#1(balance_control_~#tmp~0#1.base, balance_control_~#tmp~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem17#1 := read~int#12(balance_control_~#tmp_theta_0~0#1.base, balance_control_~#tmp_theta_0~0#1.offset + 4 * balance_control_~tmp_0~0#1, 4);call balance_control_#t~mem18#1 := read~int#20(~#K_F~0.base, ~#K_F~0.offset + 4 * balance_control_~tmp_0~0#1, 4);balance_control_~tmp_pwm_r_limiter~0#1 := balance_control_~tmp_pwm_r_limiter~0#1 + (balance_control_#t~mem16#1 - balance_control_#t~mem17#1) * balance_control_#t~mem18#1;havoc balance_control_#t~mem16#1;havoc balance_control_#t~mem17#1;havoc balance_control_#t~mem18#1;balance_control_#t~post19#1 := balance_control_~tmp_0~0#1;balance_control_~tmp_0~0#1 := 1 + balance_control_#t~post19#1;havoc balance_control_#t~post19#1; [2025-02-07 21:18:09,395 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280-1: SUMMARY for call OSEK_Task_ts1_#t~ret48#1 := ecrobot_get_gyro_sensor(3); srcloc: null [2025-02-07 21:18:09,395 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: SUMMARY for call nxt_motor_set_count(1, 0); srcloc: null [2025-02-07 21:18:09,395 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L272: OSEK_Task_ts1_~tmp___4~0#1 := (if 0 == OSEK_Task_ts1_#t~ret44#1 % 256 then 0 else 1); [2025-02-07 21:18:09,395 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L272-1: SUMMARY for call OSEK_Task_ts1_#t~ret44#1 := __startrek_read_obstacle_flag(); srcloc: null [2025-02-07 21:18:09,395 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L264: havoc ecrobot_read_bt_packet_#t~nondet28#1, ecrobot_read_bt_packet_#t~nondet29#1, ecrobot_read_bt_packet_~bt_receive_buf#1.base, ecrobot_read_bt_packet_~bt_receive_buf#1.offset, ecrobot_read_bt_packet_~sz#1;havoc ecrobot_read_bt_packet_#in~bt_receive_buf#1.base, ecrobot_read_bt_packet_#in~bt_receive_buf#1.offset, ecrobot_read_bt_packet_#in~sz#1;assume { :end_inline_ecrobot_read_bt_packet } true;call OSEK_Task_ts1_#t~mem40#1 := read~int#21(~#bt_receive_buf~0.base, ~#bt_receive_buf~0.offset, 1);OSEK_Task_ts1_~cmd_forward~0#1 := (if -(if OSEK_Task_ts1_#t~mem40#1 % 256 % 256 <= 127 then OSEK_Task_ts1_#t~mem40#1 % 256 % 256 else OSEK_Task_ts1_#t~mem40#1 % 256 % 256 - 256) % 256 <= 127 then -(if OSEK_Task_ts1_#t~mem40#1 % 256 % 256 <= 127 then OSEK_Task_ts1_#t~mem40#1 % 256 % 256 else OSEK_Task_ts1_#t~mem40#1 % 256 % 256 - 256) % 256 else -(if OSEK_Task_ts1_#t~mem40#1 % 256 % 256 <= 127 then OSEK_Task_ts1_#t~mem40#1 % 256 % 256 else OSEK_Task_ts1_#t~mem40#1 % 256 % 256 - 256) % 256 - 256);call OSEK_Task_ts1_#t~mem41#1 := read~int#21(~#bt_receive_buf~0.base, 1 + ~#bt_receive_buf~0.offset, 1);OSEK_Task_ts1_~cmd_turn~0#1 := (if OSEK_Task_ts1_#t~mem41#1 % 256 % 256 <= 127 then OSEK_Task_ts1_#t~mem41#1 % 256 % 256 else OSEK_Task_ts1_#t~mem41#1 % 256 % 256 - 256);assume { :begin_inline___startrek_read_observer_obstacle_flag } true;havoc __startrek_read_observer_obstacle_flag_#res#1;havoc __startrek_read_observer_obstacle_flag_#t~switch1335#1, __startrek_read_observer_obstacle_flag_#t~ret1336#1, __startrek_read_observer_obstacle_flag_#t~ret1337#1, __startrek_read_observer_obstacle_flag_#t~ret1338#1, __startrek_read_observer_obstacle_flag_#t~mem1339#1, __startrek_read_observer_obstacle_flag_~r1~2#1, __startrek_read_observer_obstacle_flag_~c2~2#1, __startrek_read_observer_obstacle_flag_~or3~2#1;havoc __startrek_read_observer_obstacle_flag_~r1~2#1;havoc __startrek_read_observer_obstacle_flag_~c2~2#1;havoc __startrek_read_observer_obstacle_flag_~or3~2#1;__startrek_read_observer_obstacle_flag_#t~switch1335#1 := 0 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:18:09,395 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L248: ~cal_start_time~0 := OSEK_Task_ts1_#t~ret36#1; [2025-02-07 21:18:09,395 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L248-1: SUMMARY for call OSEK_Task_ts1_#t~ret36#1 := ecrobot_get_systick_ms(); srcloc: null [2025-02-07 21:18:09,395 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1421-1: assume __startrek_assert_i0_#t~switch1060#1;call write~int#3(0, ~#__startrek_Assert_t1_i0~0.base, ~#__startrek_Assert_t1_i0~0.offset + (if ~__startrek_job~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_job~0 % 256 % 4294967296 else ~__startrek_job~0 % 256 % 4294967296 - 4294967296), 1); [2025-02-07 21:18:09,395 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1421-1: assume !__startrek_assert_i0_#t~switch1060#1;__startrek_assert_i0_#t~switch1060#1 := __startrek_assert_i0_#t~switch1060#1 || 2 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:18:09,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991-1: assume __startrek_read_observer_obstacle_flag_#t~switch1335#1;__startrek_read_observer_obstacle_flag_~or3~2#1 := ~__startrek_round~0; [2025-02-07 21:18:09,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991-1: assume !__startrek_read_observer_obstacle_flag_#t~switch1335#1;__startrek_read_observer_obstacle_flag_#t~switch1335#1 := __startrek_read_observer_obstacle_flag_#t~switch1335#1 || 1 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:18:09,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L249: SUMMARY for call __startrek_write_nxtway_gs_mode(1); srcloc: null [2025-02-07 21:18:09,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2000-1: assume __startrek_read_observer_obstacle_flag_#t~switch1335#1;__startrek_read_observer_obstacle_flag_~or3~2#1 := ~__startrek_round~0; [2025-02-07 21:18:09,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2000-1: assume !__startrek_read_observer_obstacle_flag_#t~switch1335#1;__startrek_read_observer_obstacle_flag_#t~switch1335#1 := __startrek_read_observer_obstacle_flag_#t~switch1335#1 || 2 == (if ~__startrek_task~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_task~0 % 256 % 4294967296 else ~__startrek_task~0 % 256 % 4294967296 - 4294967296); [2025-02-07 21:18:09,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1414: assume (if ~__startrek_round~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_round~0 % 256 % 4294967296 else ~__startrek_round~0 % 256 % 4294967296 - 4294967296) < (if ~__startrek_error_round~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_error_round~0 % 256 % 4294967296 else ~__startrek_error_round~0 % 256 % 4294967296 - 4294967296);~__startrek_error_round~0 := ~__startrek_round~0; [2025-02-07 21:18:09,396 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1414: assume !((if ~__startrek_round~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_round~0 % 256 % 4294967296 else ~__startrek_round~0 % 256 % 4294967296 - 4294967296) < (if ~__startrek_error_round~0 % 256 % 4294967296 <= 2147483647 then ~__startrek_error_round~0 % 256 % 4294967296 else ~__startrek_error_round~0 % 256 % 4294967296 - 4294967296)); [2025-02-07 21:18:09,411 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L321: ~__startrek_lock~0 := 0; [2025-02-07 21:18:09,411 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L321-1: SUMMARY for call __startrek_write_obstacle_flag(1); srcloc: null [2025-02-07 21:18:09,411 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L320: SUMMARY for call __startrek_write_observer_obstacle_flag(1); srcloc: null [2025-02-07 21:18:09,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L318: assume (if OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 <= 2147483647 then OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 else OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 - 4294967296) <= 25;~__startrek_lock~0 := 1; [2025-02-07 21:18:09,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L318: assume !((if OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 <= 2147483647 then OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 else OSEK_Task_ts2_~tmp___0~2#1 % 256 % 4294967296 - 4294967296) <= 25); [2025-02-07 21:18:09,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L317: OSEK_Task_ts2_#t~ret53#1 := ecrobot_get_sonar_sensor_#res#1;havoc ecrobot_get_sonar_sensor_#t~nondet51#1, ecrobot_get_sonar_sensor_~port#1, ecrobot_get_sonar_sensor_~tmp~5#1;havoc ecrobot_get_sonar_sensor_#in~port#1;assume { :end_inline_ecrobot_get_sonar_sensor } true;OSEK_Task_ts2_~tmp___0~2#1 := OSEK_Task_ts2_#t~ret53#1;havoc OSEK_Task_ts2_#t~ret53#1; [2025-02-07 21:18:15,540 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-02-07 21:18:15,541 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:18:15,576 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:18:15,576 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:18:15,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:18:15 BoogieIcfgContainer [2025-02-07 21:18:15,577 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:18:15,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:18:15,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:18:15,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:18:15,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:18:07" (1/3) ... [2025-02-07 21:18:15,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eec3f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:18:15, skipping insertion in model container [2025-02-07 21:18:15,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:18:08" (2/3) ... [2025-02-07 21:18:15,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eec3f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:18:15, skipping insertion in model container [2025-02-07 21:18:15,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:18:15" (3/3) ... [2025-02-07 21:18:15,588 INFO L128 eAbstractionObserver]: Analyzing ICFG rekcba_nxt.3.M1.c [2025-02-07 21:18:15,598 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:18:15,601 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekcba_nxt.3.M1.c that has 19 procedures, 1226 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 21:18:15,679 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:18:15,688 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;@48e2f598, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:18:15,688 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:18:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 1202 states, 745 states have (on average 1.2751677852348993) internal successors, (950), 778 states have internal predecessors, (950), 431 states have call successors, (431), 14 states have call predecessors, (431), 14 states have return successors, (431), 431 states have call predecessors, (431), 431 states have call successors, (431) [2025-02-07 21:18:15,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 874 [2025-02-07 21:18:15,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:15,755 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:15,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:15,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:15,760 INFO L85 PathProgramCache]: Analyzing trace with hash 817382898, now seen corresponding path program 1 times [2025-02-07 21:18:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:15,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601502838] [2025-02-07 21:18:15,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:15,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:16,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 873 statements into 1 equivalence classes. [2025-02-07 21:18:17,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 873 of 873 statements. [2025-02-07 21:18:17,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:17,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 24420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24420 trivial. 0 not checked. [2025-02-07 21:18:20,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:20,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601502838] [2025-02-07 21:18:20,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601502838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:20,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:20,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:20,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368704230] [2025-02-07 21:18:20,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:20,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:20,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:20,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:20,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:20,796 INFO L87 Difference]: Start difference. First operand has 1202 states, 745 states have (on average 1.2751677852348993) internal successors, (950), 778 states have internal predecessors, (950), 431 states have call successors, (431), 14 states have call predecessors, (431), 14 states have return successors, (431), 431 states have call predecessors, (431), 431 states have call successors, (431) Second operand has 6 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 2 states have call successors, (112), 2 states have call predecessors, (112), 1 states have return successors, (111), 1 states have call predecessors, (111), 1 states have call successors, (111) [2025-02-07 21:18:21,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:21,168 INFO L93 Difference]: Finished difference Result 2390 states and 4005 transitions. [2025-02-07 21:18:21,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:21,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 2 states have call successors, (112), 2 states have call predecessors, (112), 1 states have return successors, (111), 1 states have call predecessors, (111), 1 states have call successors, (111) Word has length 873 [2025-02-07 21:18:21,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:21,197 INFO L225 Difference]: With dead ends: 2390 [2025-02-07 21:18:21,198 INFO L226 Difference]: Without dead ends: 1118 [2025-02-07 21:18:21,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:21,217 INFO L435 NwaCegarLoop]: 1777 mSDtfsCounter, 1384 mSDsluCounter, 5303 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 7080 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:21,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 7080 Invalid, 136 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:21,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-02-07 21:18:21,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1118. [2025-02-07 21:18:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 697 states have (on average 1.2525107604017216) internal successors, (873), 725 states have internal predecessors, (873), 411 states have call successors, (411), 9 states have call predecessors, (411), 9 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1694 transitions. [2025-02-07 21:18:21,422 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1694 transitions. Word has length 873 [2025-02-07 21:18:21,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:21,423 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1694 transitions. [2025-02-07 21:18:21,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 2 states have call successors, (112), 2 states have call predecessors, (112), 1 states have return successors, (111), 1 states have call predecessors, (111), 1 states have call successors, (111) [2025-02-07 21:18:21,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1694 transitions. [2025-02-07 21:18:21,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2025-02-07 21:18:21,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:21,441 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:21,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:18:21,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:21,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1417228875, now seen corresponding path program 1 times [2025-02-07 21:18:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:21,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445038910] [2025-02-07 21:18:21,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:21,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:21,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 879 statements into 1 equivalence classes. [2025-02-07 21:18:22,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 879 of 879 statements. [2025-02-07 21:18:22,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:22,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 24422 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24420 trivial. 0 not checked. [2025-02-07 21:18:24,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:24,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445038910] [2025-02-07 21:18:24,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445038910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:24,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:24,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:24,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569838731] [2025-02-07 21:18:24,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:24,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:24,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:24,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:24,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:24,493 INFO L87 Difference]: Start difference. First operand 1118 states and 1694 transitions. Second operand has 6 states, 5 states have (on average 64.8) internal successors, (324), 5 states have internal predecessors, (324), 2 states have call successors, (113), 2 states have call predecessors, (113), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-02-07 21:18:24,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:24,772 INFO L93 Difference]: Finished difference Result 1124 states and 1699 transitions. [2025-02-07 21:18:24,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:24,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 64.8) internal successors, (324), 5 states have internal predecessors, (324), 2 states have call successors, (113), 2 states have call predecessors, (113), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) Word has length 879 [2025-02-07 21:18:24,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:24,783 INFO L225 Difference]: With dead ends: 1124 [2025-02-07 21:18:24,783 INFO L226 Difference]: Without dead ends: 1122 [2025-02-07 21:18:24,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:24,784 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1266 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:24,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-02-07 21:18:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2025-02-07 21:18:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 700 states have (on average 1.2514285714285713) internal successors, (876), 728 states have internal predecessors, (876), 411 states have call successors, (411), 10 states have call predecessors, (411), 10 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1697 transitions. [2025-02-07 21:18:24,959 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1697 transitions. Word has length 879 [2025-02-07 21:18:24,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:24,960 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1697 transitions. [2025-02-07 21:18:24,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 64.8) internal successors, (324), 5 states have internal predecessors, (324), 2 states have call successors, (113), 2 states have call predecessors, (113), 1 states have return successors, (112), 1 states have call predecessors, (112), 1 states have call successors, (112) [2025-02-07 21:18:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1697 transitions. [2025-02-07 21:18:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 886 [2025-02-07 21:18:24,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:24,976 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:24,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:18:24,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:24,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:24,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1197272806, now seen corresponding path program 1 times [2025-02-07 21:18:24,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:24,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682403628] [2025-02-07 21:18:24,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:24,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:25,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 885 statements into 1 equivalence classes. [2025-02-07 21:18:25,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 885 of 885 statements. [2025-02-07 21:18:25,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:25,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 24428 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24424 trivial. 0 not checked. [2025-02-07 21:18:27,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:27,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682403628] [2025-02-07 21:18:27,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682403628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:27,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:27,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:27,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122641133] [2025-02-07 21:18:27,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:27,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:27,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:27,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:27,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:27,677 INFO L87 Difference]: Start difference. First operand 1122 states and 1697 transitions. Second operand has 6 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-02-07 21:18:27,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:27,927 INFO L93 Difference]: Finished difference Result 1128 states and 1702 transitions. [2025-02-07 21:18:27,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:27,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) Word has length 885 [2025-02-07 21:18:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:27,936 INFO L225 Difference]: With dead ends: 1128 [2025-02-07 21:18:27,936 INFO L226 Difference]: Without dead ends: 1126 [2025-02-07 21:18:27,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:27,937 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1264 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:27,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2025-02-07 21:18:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1126. [2025-02-07 21:18:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 703 states have (on average 1.2503556187766713) internal successors, (879), 731 states have internal predecessors, (879), 411 states have call successors, (411), 11 states have call predecessors, (411), 11 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1700 transitions. [2025-02-07 21:18:28,024 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1700 transitions. Word has length 885 [2025-02-07 21:18:28,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:28,027 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1700 transitions. [2025-02-07 21:18:28,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-02-07 21:18:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1700 transitions. [2025-02-07 21:18:28,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2025-02-07 21:18:28,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:28,046 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:28,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:18:28,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:28,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:28,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1533198915, now seen corresponding path program 1 times [2025-02-07 21:18:28,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:28,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150750127] [2025-02-07 21:18:28,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:28,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:28,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 891 statements into 1 equivalence classes. [2025-02-07 21:18:28,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 891 of 891 statements. [2025-02-07 21:18:28,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:28,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 24438 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24432 trivial. 0 not checked. [2025-02-07 21:18:30,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:30,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150750127] [2025-02-07 21:18:30,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150750127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:30,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:30,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:30,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58124260] [2025-02-07 21:18:30,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:30,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:30,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:30,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:30,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:30,449 INFO L87 Difference]: Start difference. First operand 1126 states and 1700 transitions. Second operand has 6 states, 5 states have (on average 65.2) internal successors, (326), 5 states have internal predecessors, (326), 2 states have call successors, (115), 2 states have call predecessors, (115), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-07 21:18:30,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:30,637 INFO L93 Difference]: Finished difference Result 1132 states and 1705 transitions. [2025-02-07 21:18:30,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:30,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 65.2) internal successors, (326), 5 states have internal predecessors, (326), 2 states have call successors, (115), 2 states have call predecessors, (115), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 891 [2025-02-07 21:18:30,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:30,646 INFO L225 Difference]: With dead ends: 1132 [2025-02-07 21:18:30,646 INFO L226 Difference]: Without dead ends: 1130 [2025-02-07 21:18:30,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:30,647 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1262 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:30,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:30,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-02-07 21:18:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2025-02-07 21:18:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 706 states have (on average 1.2492917847025495) internal successors, (882), 734 states have internal predecessors, (882), 411 states have call successors, (411), 12 states have call predecessors, (411), 12 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1703 transitions. [2025-02-07 21:18:30,729 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1703 transitions. Word has length 891 [2025-02-07 21:18:30,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:30,733 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1703 transitions. [2025-02-07 21:18:30,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 65.2) internal successors, (326), 5 states have internal predecessors, (326), 2 states have call successors, (115), 2 states have call predecessors, (115), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-07 21:18:30,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1703 transitions. [2025-02-07 21:18:30,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 898 [2025-02-07 21:18:30,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:30,743 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:30,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:18:30,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:30,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1902439710, now seen corresponding path program 1 times [2025-02-07 21:18:30,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:30,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434487783] [2025-02-07 21:18:30,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:30,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:31,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 897 statements into 1 equivalence classes. [2025-02-07 21:18:31,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 897 of 897 statements. [2025-02-07 21:18:31,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:31,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:32,885 INFO L134 CoverageAnalysis]: Checked inductivity of 24452 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24444 trivial. 0 not checked. [2025-02-07 21:18:32,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:32,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434487783] [2025-02-07 21:18:32,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434487783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:32,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:32,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:32,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226953829] [2025-02-07 21:18:32,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:32,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:32,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:32,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:32,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:32,887 INFO L87 Difference]: Start difference. First operand 1130 states and 1703 transitions. Second operand has 6 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 2 states have call successors, (116), 2 states have call predecessors, (116), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-07 21:18:33,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:33,077 INFO L93 Difference]: Finished difference Result 1136 states and 1708 transitions. [2025-02-07 21:18:33,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:33,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 2 states have call successors, (116), 2 states have call predecessors, (116), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 897 [2025-02-07 21:18:33,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:33,085 INFO L225 Difference]: With dead ends: 1136 [2025-02-07 21:18:33,085 INFO L226 Difference]: Without dead ends: 1134 [2025-02-07 21:18:33,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:33,086 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1260 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:33,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:33,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2025-02-07 21:18:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1134. [2025-02-07 21:18:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 709 states have (on average 1.2482369534555713) internal successors, (885), 737 states have internal predecessors, (885), 411 states have call successors, (411), 13 states have call predecessors, (411), 13 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1706 transitions. [2025-02-07 21:18:33,169 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1706 transitions. Word has length 897 [2025-02-07 21:18:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:33,170 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1706 transitions. [2025-02-07 21:18:33,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 2 states have call successors, (116), 2 states have call predecessors, (116), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-02-07 21:18:33,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1706 transitions. [2025-02-07 21:18:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2025-02-07 21:18:33,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:33,177 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:33,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 21:18:33,178 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:33,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:33,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1104111427, now seen corresponding path program 1 times [2025-02-07 21:18:33,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:33,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922189355] [2025-02-07 21:18:33,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:33,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 903 statements into 1 equivalence classes. [2025-02-07 21:18:33,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 903 of 903 statements. [2025-02-07 21:18:33,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:33,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 24470 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24460 trivial. 0 not checked. [2025-02-07 21:18:35,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:35,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922189355] [2025-02-07 21:18:35,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922189355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:35,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:35,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:35,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780110971] [2025-02-07 21:18:35,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:35,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:35,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:35,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:35,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:35,799 INFO L87 Difference]: Start difference. First operand 1134 states and 1706 transitions. Second operand has 6 states, 5 states have (on average 65.6) internal successors, (328), 5 states have internal predecessors, (328), 2 states have call successors, (117), 2 states have call predecessors, (117), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-07 21:18:35,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:35,994 INFO L93 Difference]: Finished difference Result 1140 states and 1711 transitions. [2025-02-07 21:18:35,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:35,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 65.6) internal successors, (328), 5 states have internal predecessors, (328), 2 states have call successors, (117), 2 states have call predecessors, (117), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) Word has length 903 [2025-02-07 21:18:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:36,001 INFO L225 Difference]: With dead ends: 1140 [2025-02-07 21:18:36,002 INFO L226 Difference]: Without dead ends: 1138 [2025-02-07 21:18:36,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:36,002 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1258 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:36,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:36,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-02-07 21:18:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2025-02-07 21:18:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 712 states have (on average 1.247191011235955) internal successors, (888), 740 states have internal predecessors, (888), 411 states have call successors, (411), 14 states have call predecessors, (411), 14 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1709 transitions. [2025-02-07 21:18:36,090 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1709 transitions. Word has length 903 [2025-02-07 21:18:36,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:36,091 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1709 transitions. [2025-02-07 21:18:36,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 65.6) internal successors, (328), 5 states have internal predecessors, (328), 2 states have call successors, (117), 2 states have call predecessors, (117), 1 states have return successors, (116), 1 states have call predecessors, (116), 1 states have call successors, (116) [2025-02-07 21:18:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1709 transitions. [2025-02-07 21:18:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 910 [2025-02-07 21:18:36,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:36,099 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:36,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:18:36,099 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:36,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:36,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1361733094, now seen corresponding path program 1 times [2025-02-07 21:18:36,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:36,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405939633] [2025-02-07 21:18:36,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:36,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:36,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 909 statements into 1 equivalence classes. [2025-02-07 21:18:36,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 909 of 909 statements. [2025-02-07 21:18:36,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:36,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 24492 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24480 trivial. 0 not checked. [2025-02-07 21:18:38,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:38,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405939633] [2025-02-07 21:18:38,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405939633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:38,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:38,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:38,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052630384] [2025-02-07 21:18:38,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:38,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:38,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:38,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:38,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:38,368 INFO L87 Difference]: Start difference. First operand 1138 states and 1709 transitions. Second operand has 6 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 2 states have call successors, (118), 2 states have call predecessors, (118), 1 states have return successors, (117), 1 states have call predecessors, (117), 1 states have call successors, (117) [2025-02-07 21:18:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:38,551 INFO L93 Difference]: Finished difference Result 1144 states and 1714 transitions. [2025-02-07 21:18:38,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:38,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 2 states have call successors, (118), 2 states have call predecessors, (118), 1 states have return successors, (117), 1 states have call predecessors, (117), 1 states have call successors, (117) Word has length 909 [2025-02-07 21:18:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:38,559 INFO L225 Difference]: With dead ends: 1144 [2025-02-07 21:18:38,559 INFO L226 Difference]: Without dead ends: 1142 [2025-02-07 21:18:38,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:38,560 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1256 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:38,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:38,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2025-02-07 21:18:38,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2025-02-07 21:18:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 715 states have (on average 1.2461538461538462) internal successors, (891), 743 states have internal predecessors, (891), 411 states have call successors, (411), 15 states have call predecessors, (411), 15 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:38,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1712 transitions. [2025-02-07 21:18:38,686 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1712 transitions. Word has length 909 [2025-02-07 21:18:38,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:38,687 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1712 transitions. [2025-02-07 21:18:38,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 2 states have call successors, (118), 2 states have call predecessors, (118), 1 states have return successors, (117), 1 states have call predecessors, (117), 1 states have call successors, (117) [2025-02-07 21:18:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1712 transitions. [2025-02-07 21:18:38,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2025-02-07 21:18:38,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:38,695 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:38,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:18:38,696 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:38,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash 249550155, now seen corresponding path program 1 times [2025-02-07 21:18:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:38,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631301742] [2025-02-07 21:18:38,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:38,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:38,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 915 statements into 1 equivalence classes. [2025-02-07 21:18:39,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 915 of 915 statements. [2025-02-07 21:18:39,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:39,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 24518 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 24504 trivial. 0 not checked. [2025-02-07 21:18:41,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:41,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631301742] [2025-02-07 21:18:41,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631301742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:41,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:41,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:41,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752035327] [2025-02-07 21:18:41,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:41,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:41,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:41,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:41,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:41,035 INFO L87 Difference]: Start difference. First operand 1142 states and 1712 transitions. Second operand has 6 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 2 states have call successors, (119), 2 states have call predecessors, (119), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-07 21:18:41,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:41,248 INFO L93 Difference]: Finished difference Result 1148 states and 1717 transitions. [2025-02-07 21:18:41,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:41,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 2 states have call successors, (119), 2 states have call predecessors, (119), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) Word has length 915 [2025-02-07 21:18:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:41,255 INFO L225 Difference]: With dead ends: 1148 [2025-02-07 21:18:41,255 INFO L226 Difference]: Without dead ends: 1146 [2025-02-07 21:18:41,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:41,256 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1254 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:41,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:41,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-02-07 21:18:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1146. [2025-02-07 21:18:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 718 states have (on average 1.2451253481894151) internal successors, (894), 746 states have internal predecessors, (894), 411 states have call successors, (411), 16 states have call predecessors, (411), 16 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1715 transitions. [2025-02-07 21:18:41,357 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1715 transitions. Word has length 915 [2025-02-07 21:18:41,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:41,358 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1715 transitions. [2025-02-07 21:18:41,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 2 states have call successors, (119), 2 states have call predecessors, (119), 1 states have return successors, (118), 1 states have call predecessors, (118), 1 states have call successors, (118) [2025-02-07 21:18:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1715 transitions. [2025-02-07 21:18:41,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 922 [2025-02-07 21:18:41,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:41,372 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:41,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:18:41,372 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:41,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:41,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1613456398, now seen corresponding path program 1 times [2025-02-07 21:18:41,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:41,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067197131] [2025-02-07 21:18:41,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:41,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:41,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 921 statements into 1 equivalence classes. [2025-02-07 21:18:42,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 921 of 921 statements. [2025-02-07 21:18:42,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:42,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 24548 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 24532 trivial. 0 not checked. [2025-02-07 21:18:44,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:44,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067197131] [2025-02-07 21:18:44,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067197131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:44,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:44,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:44,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527008036] [2025-02-07 21:18:44,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:44,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:44,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:44,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:44,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:44,150 INFO L87 Difference]: Start difference. First operand 1146 states and 1715 transitions. Second operand has 6 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 2 states have call successors, (120), 2 states have call predecessors, (120), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-07 21:18:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:44,368 INFO L93 Difference]: Finished difference Result 1152 states and 1720 transitions. [2025-02-07 21:18:44,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:44,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 2 states have call successors, (120), 2 states have call predecessors, (120), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 921 [2025-02-07 21:18:44,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:44,375 INFO L225 Difference]: With dead ends: 1152 [2025-02-07 21:18:44,375 INFO L226 Difference]: Without dead ends: 1150 [2025-02-07 21:18:44,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:44,376 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1252 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:44,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2025-02-07 21:18:44,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1150. [2025-02-07 21:18:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 721 states have (on average 1.2441054091539527) internal successors, (897), 749 states have internal predecessors, (897), 411 states have call successors, (411), 17 states have call predecessors, (411), 17 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1718 transitions. [2025-02-07 21:18:44,475 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1718 transitions. Word has length 921 [2025-02-07 21:18:44,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:44,476 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1718 transitions. [2025-02-07 21:18:44,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 2 states have call successors, (120), 2 states have call predecessors, (120), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-07 21:18:44,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1718 transitions. [2025-02-07 21:18:44,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2025-02-07 21:18:44,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:44,484 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:44,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 21:18:44,484 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:44,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:44,487 INFO L85 PathProgramCache]: Analyzing trace with hash 977715291, now seen corresponding path program 1 times [2025-02-07 21:18:44,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:44,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414595939] [2025-02-07 21:18:44,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:44,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:44,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 927 statements into 1 equivalence classes. [2025-02-07 21:18:44,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 927 of 927 statements. [2025-02-07 21:18:44,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:44,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 24582 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 24564 trivial. 0 not checked. [2025-02-07 21:18:46,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:46,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414595939] [2025-02-07 21:18:46,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414595939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:46,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:46,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:46,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256009482] [2025-02-07 21:18:46,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:46,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:46,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:46,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:46,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:46,923 INFO L87 Difference]: Start difference. First operand 1150 states and 1718 transitions. Second operand has 6 states, 5 states have (on average 66.4) internal successors, (332), 5 states have internal predecessors, (332), 2 states have call successors, (121), 2 states have call predecessors, (121), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-02-07 21:18:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:47,113 INFO L93 Difference]: Finished difference Result 1156 states and 1723 transitions. [2025-02-07 21:18:47,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:47,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 66.4) internal successors, (332), 5 states have internal predecessors, (332), 2 states have call successors, (121), 2 states have call predecessors, (121), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) Word has length 927 [2025-02-07 21:18:47,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:47,122 INFO L225 Difference]: With dead ends: 1156 [2025-02-07 21:18:47,122 INFO L226 Difference]: Without dead ends: 1154 [2025-02-07 21:18:47,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:47,124 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1250 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:47,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:47,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2025-02-07 21:18:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1154. [2025-02-07 21:18:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 724 states have (on average 1.2430939226519337) internal successors, (900), 752 states have internal predecessors, (900), 411 states have call successors, (411), 18 states have call predecessors, (411), 18 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1721 transitions. [2025-02-07 21:18:47,226 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1721 transitions. Word has length 927 [2025-02-07 21:18:47,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:47,226 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1721 transitions. [2025-02-07 21:18:47,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 66.4) internal successors, (332), 5 states have internal predecessors, (332), 2 states have call successors, (121), 2 states have call predecessors, (121), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-02-07 21:18:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1721 transitions. [2025-02-07 21:18:47,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 934 [2025-02-07 21:18:47,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:47,234 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:47,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 21:18:47,234 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:47,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:47,235 INFO L85 PathProgramCache]: Analyzing trace with hash -965383930, now seen corresponding path program 1 times [2025-02-07 21:18:47,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:47,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013364216] [2025-02-07 21:18:47,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:47,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:47,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 933 statements into 1 equivalence classes. [2025-02-07 21:18:47,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 933 of 933 statements. [2025-02-07 21:18:47,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:47,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 24620 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 24600 trivial. 0 not checked. [2025-02-07 21:18:49,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:49,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013364216] [2025-02-07 21:18:49,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013364216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:49,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:49,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:49,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620488242] [2025-02-07 21:18:49,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:49,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:49,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:49,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:49,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:49,782 INFO L87 Difference]: Start difference. First operand 1154 states and 1721 transitions. Second operand has 6 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (121), 1 states have call predecessors, (121), 1 states have call successors, (121) [2025-02-07 21:18:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:49,980 INFO L93 Difference]: Finished difference Result 1160 states and 1726 transitions. [2025-02-07 21:18:49,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:49,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (121), 1 states have call predecessors, (121), 1 states have call successors, (121) Word has length 933 [2025-02-07 21:18:49,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:49,988 INFO L225 Difference]: With dead ends: 1160 [2025-02-07 21:18:49,988 INFO L226 Difference]: Without dead ends: 1158 [2025-02-07 21:18:49,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:49,990 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1248 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:49,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-02-07 21:18:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1158. [2025-02-07 21:18:50,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 727 states have (on average 1.2420907840440165) internal successors, (903), 755 states have internal predecessors, (903), 411 states have call successors, (411), 19 states have call predecessors, (411), 19 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1724 transitions. [2025-02-07 21:18:50,097 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1724 transitions. Word has length 933 [2025-02-07 21:18:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:50,098 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1724 transitions. [2025-02-07 21:18:50,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 2 states have call successors, (122), 2 states have call predecessors, (122), 1 states have return successors, (121), 1 states have call predecessors, (121), 1 states have call successors, (121) [2025-02-07 21:18:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1724 transitions. [2025-02-07 21:18:50,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2025-02-07 21:18:50,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:50,106 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:50,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 21:18:50,106 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:50,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:50,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1632164979, now seen corresponding path program 1 times [2025-02-07 21:18:50,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:50,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470868625] [2025-02-07 21:18:50,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:50,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:50,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 939 statements into 1 equivalence classes. [2025-02-07 21:18:50,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 939 of 939 statements. [2025-02-07 21:18:50,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:50,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 24662 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 24640 trivial. 0 not checked. [2025-02-07 21:18:52,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:52,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470868625] [2025-02-07 21:18:52,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470868625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:52,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:52,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:52,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623008586] [2025-02-07 21:18:52,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:52,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:52,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:52,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:52,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:52,664 INFO L87 Difference]: Start difference. First operand 1158 states and 1724 transitions. Second operand has 6 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-07 21:18:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:52,884 INFO L93 Difference]: Finished difference Result 1164 states and 1729 transitions. [2025-02-07 21:18:52,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:52,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) Word has length 939 [2025-02-07 21:18:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:52,891 INFO L225 Difference]: With dead ends: 1164 [2025-02-07 21:18:52,891 INFO L226 Difference]: Without dead ends: 1162 [2025-02-07 21:18:52,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:52,892 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1246 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:52,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:52,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2025-02-07 21:18:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2025-02-07 21:18:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 730 states have (on average 1.2410958904109588) internal successors, (906), 758 states have internal predecessors, (906), 411 states have call successors, (411), 20 states have call predecessors, (411), 20 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:53,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1727 transitions. [2025-02-07 21:18:53,087 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1727 transitions. Word has length 939 [2025-02-07 21:18:53,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:53,088 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1727 transitions. [2025-02-07 21:18:53,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 2 states have call successors, (123), 2 states have call predecessors, (123), 1 states have return successors, (122), 1 states have call predecessors, (122), 1 states have call successors, (122) [2025-02-07 21:18:53,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1727 transitions. [2025-02-07 21:18:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 946 [2025-02-07 21:18:53,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:53,096 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:53,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 21:18:53,096 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:53,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:53,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1090158882, now seen corresponding path program 1 times [2025-02-07 21:18:53,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:53,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155122934] [2025-02-07 21:18:53,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:53,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:53,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 945 statements into 1 equivalence classes. [2025-02-07 21:18:53,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 945 of 945 statements. [2025-02-07 21:18:53,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:53,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 24708 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24684 trivial. 0 not checked. [2025-02-07 21:18:55,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:55,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155122934] [2025-02-07 21:18:55,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155122934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:55,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:55,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:55,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047545939] [2025-02-07 21:18:55,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:55,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:55,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:55,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:55,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:55,992 INFO L87 Difference]: Start difference. First operand 1162 states and 1727 transitions. Second operand has 6 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 2 states have call successors, (124), 2 states have call predecessors, (124), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-07 21:18:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:56,270 INFO L93 Difference]: Finished difference Result 1168 states and 1732 transitions. [2025-02-07 21:18:56,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:56,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 2 states have call successors, (124), 2 states have call predecessors, (124), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) Word has length 945 [2025-02-07 21:18:56,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:56,276 INFO L225 Difference]: With dead ends: 1168 [2025-02-07 21:18:56,276 INFO L226 Difference]: Without dead ends: 1166 [2025-02-07 21:18:56,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:56,277 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1244 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:56,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2025-02-07 21:18:56,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1166. [2025-02-07 21:18:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 733 states have (on average 1.2401091405184175) internal successors, (909), 761 states have internal predecessors, (909), 411 states have call successors, (411), 21 states have call predecessors, (411), 21 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1730 transitions. [2025-02-07 21:18:56,389 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1730 transitions. Word has length 945 [2025-02-07 21:18:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:56,389 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 1730 transitions. [2025-02-07 21:18:56,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 2 states have call successors, (124), 2 states have call predecessors, (124), 1 states have return successors, (123), 1 states have call predecessors, (123), 1 states have call successors, (123) [2025-02-07 21:18:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1730 transitions. [2025-02-07 21:18:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2025-02-07 21:18:56,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:56,396 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:56,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 21:18:56,397 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:56,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2075975059, now seen corresponding path program 1 times [2025-02-07 21:18:56,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:56,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087325810] [2025-02-07 21:18:56,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:56,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:56,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 951 statements into 1 equivalence classes. [2025-02-07 21:18:56,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 951 of 951 statements. [2025-02-07 21:18:56,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:56,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:18:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 24758 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 24732 trivial. 0 not checked. [2025-02-07 21:18:59,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:18:59,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087325810] [2025-02-07 21:18:59,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087325810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:18:59,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:18:59,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:18:59,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601782327] [2025-02-07 21:18:59,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:18:59,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:18:59,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:18:59,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:18:59,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:18:59,167 INFO L87 Difference]: Start difference. First operand 1166 states and 1730 transitions. Second operand has 6 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-02-07 21:18:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:18:59,363 INFO L93 Difference]: Finished difference Result 1172 states and 1735 transitions. [2025-02-07 21:18:59,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:18:59,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) Word has length 951 [2025-02-07 21:18:59,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:18:59,370 INFO L225 Difference]: With dead ends: 1172 [2025-02-07 21:18:59,370 INFO L226 Difference]: Without dead ends: 1170 [2025-02-07 21:18:59,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:18:59,371 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1242 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:18:59,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:18:59,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2025-02-07 21:18:59,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1170. [2025-02-07 21:18:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 736 states have (on average 1.2391304347826086) internal successors, (912), 764 states have internal predecessors, (912), 411 states have call successors, (411), 22 states have call predecessors, (411), 22 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:18:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1733 transitions. [2025-02-07 21:18:59,489 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1733 transitions. Word has length 951 [2025-02-07 21:18:59,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:18:59,491 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1733 transitions. [2025-02-07 21:18:59,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 2 states have call successors, (125), 2 states have call predecessors, (125), 1 states have return successors, (124), 1 states have call predecessors, (124), 1 states have call successors, (124) [2025-02-07 21:18:59,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1733 transitions. [2025-02-07 21:18:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 958 [2025-02-07 21:18:59,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:18:59,498 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:18:59,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 21:18:59,499 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:18:59,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:18:59,499 INFO L85 PathProgramCache]: Analyzing trace with hash 811833414, now seen corresponding path program 1 times [2025-02-07 21:18:59,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:18:59,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218365626] [2025-02-07 21:18:59,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:18:59,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:18:59,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 957 statements into 1 equivalence classes. [2025-02-07 21:18:59,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 957 of 957 statements. [2025-02-07 21:18:59,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:18:59,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:19:02,299 INFO L134 CoverageAnalysis]: Checked inductivity of 24812 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 24784 trivial. 0 not checked. [2025-02-07 21:19:02,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:19:02,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218365626] [2025-02-07 21:19:02,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218365626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:19:02,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:19:02,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:19:02,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439034680] [2025-02-07 21:19:02,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:19:02,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:19:02,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:19:02,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:19:02,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:19:02,305 INFO L87 Difference]: Start difference. First operand 1170 states and 1733 transitions. Second operand has 6 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 2 states have call successors, (126), 2 states have call predecessors, (126), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-07 21:19:02,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:19:02,517 INFO L93 Difference]: Finished difference Result 1176 states and 1738 transitions. [2025-02-07 21:19:02,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:19:02,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 2 states have call successors, (126), 2 states have call predecessors, (126), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) Word has length 957 [2025-02-07 21:19:02,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:19:02,523 INFO L225 Difference]: With dead ends: 1176 [2025-02-07 21:19:02,523 INFO L226 Difference]: Without dead ends: 1174 [2025-02-07 21:19:02,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:19:02,524 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1240 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:19:02,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:19:02,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-02-07 21:19:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2025-02-07 21:19:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 739 states have (on average 1.2381596752368065) internal successors, (915), 767 states have internal predecessors, (915), 411 states have call successors, (411), 23 states have call predecessors, (411), 23 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:19:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1736 transitions. [2025-02-07 21:19:02,645 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1736 transitions. Word has length 957 [2025-02-07 21:19:02,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:19:02,645 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1736 transitions. [2025-02-07 21:19:02,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 2 states have call successors, (126), 2 states have call predecessors, (126), 1 states have return successors, (125), 1 states have call predecessors, (125), 1 states have call successors, (125) [2025-02-07 21:19:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1736 transitions. [2025-02-07 21:19:02,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2025-02-07 21:19:02,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:19:02,652 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:19:02,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 21:19:02,652 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:19:02,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:19:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1861519429, now seen corresponding path program 1 times [2025-02-07 21:19:02,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:19:02,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763304655] [2025-02-07 21:19:02,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:19:02,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:19:02,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 963 statements into 1 equivalence classes. [2025-02-07 21:19:03,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 963 of 963 statements. [2025-02-07 21:19:03,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:19:03,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:19:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 24870 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 24840 trivial. 0 not checked. [2025-02-07 21:19:05,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:19:05,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763304655] [2025-02-07 21:19:05,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763304655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:19:05,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:19:05,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:19:05,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321976490] [2025-02-07 21:19:05,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:19:05,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:19:05,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:19:05,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:19:05,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:19:05,727 INFO L87 Difference]: Start difference. First operand 1174 states and 1736 transitions. Second operand has 6 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 2 states have call successors, (127), 2 states have call predecessors, (127), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-07 21:19:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:19:05,945 INFO L93 Difference]: Finished difference Result 1180 states and 1741 transitions. [2025-02-07 21:19:05,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:19:05,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 2 states have call successors, (127), 2 states have call predecessors, (127), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 963 [2025-02-07 21:19:05,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:19:05,950 INFO L225 Difference]: With dead ends: 1180 [2025-02-07 21:19:05,950 INFO L226 Difference]: Without dead ends: 1178 [2025-02-07 21:19:05,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:19:05,951 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1238 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:19:05,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:19:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2025-02-07 21:19:06,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1178. [2025-02-07 21:19:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 742 states have (on average 1.2371967654986522) internal successors, (918), 770 states have internal predecessors, (918), 411 states have call successors, (411), 24 states have call predecessors, (411), 24 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:19:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1739 transitions. [2025-02-07 21:19:06,076 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1739 transitions. Word has length 963 [2025-02-07 21:19:06,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:19:06,077 INFO L471 AbstractCegarLoop]: Abstraction has 1178 states and 1739 transitions. [2025-02-07 21:19:06,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 2 states have call successors, (127), 2 states have call predecessors, (127), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-07 21:19:06,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1739 transitions. [2025-02-07 21:19:06,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2025-02-07 21:19:06,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:19:06,084 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:19:06,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 21:19:06,084 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:19:06,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:19:06,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1338139250, now seen corresponding path program 1 times [2025-02-07 21:19:06,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:19:06,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247164287] [2025-02-07 21:19:06,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:19:06,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:19:06,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 969 statements into 1 equivalence classes. [2025-02-07 21:19:06,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 969 of 969 statements. [2025-02-07 21:19:06,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:19:06,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:19:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 24932 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24900 trivial. 0 not checked. [2025-02-07 21:19:09,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:19:09,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247164287] [2025-02-07 21:19:09,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247164287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:19:09,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:19:09,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:19:09,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576909070] [2025-02-07 21:19:09,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:19:09,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:19:09,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:19:09,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:19:09,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:19:09,097 INFO L87 Difference]: Start difference. First operand 1178 states and 1739 transitions. Second operand has 6 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 2 states have call successors, (128), 2 states have call predecessors, (128), 1 states have return successors, (127), 1 states have call predecessors, (127), 1 states have call successors, (127) [2025-02-07 21:19:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:19:09,331 INFO L93 Difference]: Finished difference Result 1184 states and 1744 transitions. [2025-02-07 21:19:09,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:19:09,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 2 states have call successors, (128), 2 states have call predecessors, (128), 1 states have return successors, (127), 1 states have call predecessors, (127), 1 states have call successors, (127) Word has length 969 [2025-02-07 21:19:09,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:19:09,337 INFO L225 Difference]: With dead ends: 1184 [2025-02-07 21:19:09,337 INFO L226 Difference]: Without dead ends: 1182 [2025-02-07 21:19:09,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:19:09,338 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1236 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:19:09,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:19:09,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-02-07 21:19:09,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1182. [2025-02-07 21:19:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 745 states have (on average 1.236241610738255) internal successors, (921), 773 states have internal predecessors, (921), 411 states have call successors, (411), 25 states have call predecessors, (411), 25 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:19:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1742 transitions. [2025-02-07 21:19:09,541 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1742 transitions. Word has length 969 [2025-02-07 21:19:09,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:19:09,545 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1742 transitions. [2025-02-07 21:19:09,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 2 states have call successors, (128), 2 states have call predecessors, (128), 1 states have return successors, (127), 1 states have call predecessors, (127), 1 states have call successors, (127) [2025-02-07 21:19:09,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1742 transitions. [2025-02-07 21:19:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 976 [2025-02-07 21:19:09,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:19:09,556 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:19:09,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 21:19:09,560 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:19:09,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:19:09,560 INFO L85 PathProgramCache]: Analyzing trace with hash -315662613, now seen corresponding path program 1 times [2025-02-07 21:19:09,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:19:09,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583508644] [2025-02-07 21:19:09,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:19:09,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:19:09,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 975 statements into 1 equivalence classes. [2025-02-07 21:19:10,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 975 of 975 statements. [2025-02-07 21:19:10,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:19:10,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:19:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 24998 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 24964 trivial. 0 not checked. [2025-02-07 21:19:12,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:19:12,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583508644] [2025-02-07 21:19:12,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583508644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:19:12,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:19:12,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:19:12,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133655685] [2025-02-07 21:19:12,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:19:12,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:19:12,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:19:12,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:19:12,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:19:12,733 INFO L87 Difference]: Start difference. First operand 1182 states and 1742 transitions. Second operand has 6 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 2 states have call successors, (129), 2 states have call predecessors, (129), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-02-07 21:19:12,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:19:12,965 INFO L93 Difference]: Finished difference Result 1188 states and 1747 transitions. [2025-02-07 21:19:12,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:19:12,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 2 states have call successors, (129), 2 states have call predecessors, (129), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) Word has length 975 [2025-02-07 21:19:12,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:19:12,971 INFO L225 Difference]: With dead ends: 1188 [2025-02-07 21:19:12,971 INFO L226 Difference]: Without dead ends: 1186 [2025-02-07 21:19:12,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:19:12,972 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1234 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:19:12,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:19:12,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2025-02-07 21:19:13,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2025-02-07 21:19:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 748 states have (on average 1.2352941176470589) internal successors, (924), 776 states have internal predecessors, (924), 411 states have call successors, (411), 26 states have call predecessors, (411), 26 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:19:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1745 transitions. [2025-02-07 21:19:13,102 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1745 transitions. Word has length 975 [2025-02-07 21:19:13,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:19:13,104 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1745 transitions. [2025-02-07 21:19:13,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 2 states have call successors, (129), 2 states have call predecessors, (129), 1 states have return successors, (128), 1 states have call predecessors, (128), 1 states have call successors, (128) [2025-02-07 21:19:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1745 transitions. [2025-02-07 21:19:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 982 [2025-02-07 21:19:13,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:19:13,111 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:19:13,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 21:19:13,111 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:19:13,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:19:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1765446566, now seen corresponding path program 1 times [2025-02-07 21:19:13,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:19:13,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449015521] [2025-02-07 21:19:13,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:19:13,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:19:13,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 981 statements into 1 equivalence classes. [2025-02-07 21:19:13,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 981 of 981 statements. [2025-02-07 21:19:13,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:19:13,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:19:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 25068 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 25032 trivial. 0 not checked. [2025-02-07 21:19:16,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:19:16,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449015521] [2025-02-07 21:19:16,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449015521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:19:16,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:19:16,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:19:16,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024801017] [2025-02-07 21:19:16,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:19:16,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:19:16,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:19:16,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:19:16,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:19:16,168 INFO L87 Difference]: Start difference. First operand 1186 states and 1745 transitions. Second operand has 6 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 2 states have call successors, (130), 2 states have call predecessors, (130), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) [2025-02-07 21:19:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:19:16,419 INFO L93 Difference]: Finished difference Result 1192 states and 1750 transitions. [2025-02-07 21:19:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:19:16,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 2 states have call successors, (130), 2 states have call predecessors, (130), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) Word has length 981 [2025-02-07 21:19:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:19:16,424 INFO L225 Difference]: With dead ends: 1192 [2025-02-07 21:19:16,428 INFO L226 Difference]: Without dead ends: 1190 [2025-02-07 21:19:16,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:19:16,428 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1232 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:19:16,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1232 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:19:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2025-02-07 21:19:16,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190. [2025-02-07 21:19:16,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 751 states have (on average 1.2343541944074568) internal successors, (927), 779 states have internal predecessors, (927), 411 states have call successors, (411), 27 states have call predecessors, (411), 27 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:19:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1748 transitions. [2025-02-07 21:19:16,564 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1748 transitions. Word has length 981 [2025-02-07 21:19:16,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:19:16,565 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1748 transitions. [2025-02-07 21:19:16,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 68.2) internal successors, (341), 5 states have internal predecessors, (341), 2 states have call successors, (130), 2 states have call predecessors, (130), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) [2025-02-07 21:19:16,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1748 transitions. [2025-02-07 21:19:16,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2025-02-07 21:19:16,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:19:16,572 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:19:16,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 21:19:16,572 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:19:16,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:19:16,572 INFO L85 PathProgramCache]: Analyzing trace with hash -709540061, now seen corresponding path program 1 times [2025-02-07 21:19:16,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:19:16,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067303528] [2025-02-07 21:19:16,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:19:16,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:19:16,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 987 statements into 1 equivalence classes. [2025-02-07 21:19:17,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 987 of 987 statements. [2025-02-07 21:19:17,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:19:17,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:19:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 25142 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 25104 trivial. 0 not checked. [2025-02-07 21:19:19,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:19:19,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067303528] [2025-02-07 21:19:19,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067303528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:19:19,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:19:19,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:19:19,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814034183] [2025-02-07 21:19:19,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:19:19,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:19:19,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:19:19,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:19:19,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:19:19,916 INFO L87 Difference]: Start difference. First operand 1190 states and 1748 transitions. Second operand has 6 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 2 states have call successors, (131), 2 states have call predecessors, (131), 1 states have return successors, (130), 1 states have call predecessors, (130), 1 states have call successors, (130) [2025-02-07 21:19:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:19:20,170 INFO L93 Difference]: Finished difference Result 1196 states and 1753 transitions. [2025-02-07 21:19:20,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:19:20,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 2 states have call successors, (131), 2 states have call predecessors, (131), 1 states have return successors, (130), 1 states have call predecessors, (130), 1 states have call successors, (130) Word has length 987 [2025-02-07 21:19:20,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:19:20,176 INFO L225 Difference]: With dead ends: 1196 [2025-02-07 21:19:20,176 INFO L226 Difference]: Without dead ends: 1194 [2025-02-07 21:19:20,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:19:20,177 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1230 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:19:20,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:19:20,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2025-02-07 21:19:20,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1194. [2025-02-07 21:19:20,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 754 states have (on average 1.23342175066313) internal successors, (930), 782 states have internal predecessors, (930), 411 states have call successors, (411), 28 states have call predecessors, (411), 28 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:19:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1751 transitions. [2025-02-07 21:19:20,322 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1751 transitions. Word has length 987 [2025-02-07 21:19:20,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:19:20,323 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1751 transitions. [2025-02-07 21:19:20,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 2 states have call successors, (131), 2 states have call predecessors, (131), 1 states have return successors, (130), 1 states have call predecessors, (130), 1 states have call successors, (130) [2025-02-07 21:19:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1751 transitions. [2025-02-07 21:19:20,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 994 [2025-02-07 21:19:20,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:19:20,331 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:19:20,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 21:19:20,331 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:19:20,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:19:20,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1258414050, now seen corresponding path program 1 times [2025-02-07 21:19:20,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:19:20,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497739186] [2025-02-07 21:19:20,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:19:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:19:20,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 993 statements into 1 equivalence classes. [2025-02-07 21:19:20,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 993 of 993 statements. [2025-02-07 21:19:20,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:19:20,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:19:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 25220 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 25180 trivial. 0 not checked. [2025-02-07 21:19:23,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:19:23,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497739186] [2025-02-07 21:19:23,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497739186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:19:23,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:19:23,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:19:23,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94049713] [2025-02-07 21:19:23,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:19:23,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:19:23,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:19:23,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:19:23,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:19:23,695 INFO L87 Difference]: Start difference. First operand 1194 states and 1751 transitions. Second operand has 6 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 2 states have call successors, (132), 2 states have call predecessors, (132), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-02-07 21:19:23,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:19:23,929 INFO L93 Difference]: Finished difference Result 1200 states and 1756 transitions. [2025-02-07 21:19:23,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:19:23,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 2 states have call successors, (132), 2 states have call predecessors, (132), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) Word has length 993 [2025-02-07 21:19:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:19:23,934 INFO L225 Difference]: With dead ends: 1200 [2025-02-07 21:19:23,935 INFO L226 Difference]: Without dead ends: 1198 [2025-02-07 21:19:23,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:19:23,935 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1228 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:19:23,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:19:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-02-07 21:19:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2025-02-07 21:19:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 757 states have (on average 1.2324966974900924) internal successors, (933), 785 states have internal predecessors, (933), 411 states have call successors, (411), 29 states have call predecessors, (411), 29 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:19:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1754 transitions. [2025-02-07 21:19:24,084 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1754 transitions. Word has length 993 [2025-02-07 21:19:24,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:19:24,085 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1754 transitions. [2025-02-07 21:19:24,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 68.6) internal successors, (343), 5 states have internal predecessors, (343), 2 states have call successors, (132), 2 states have call predecessors, (132), 1 states have return successors, (131), 1 states have call predecessors, (131), 1 states have call successors, (131) [2025-02-07 21:19:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1754 transitions. [2025-02-07 21:19:24,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1000 [2025-02-07 21:19:24,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:19:24,094 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:19:24,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 21:19:24,094 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:19:24,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:19:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1094982557, now seen corresponding path program 1 times [2025-02-07 21:19:24,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:19:24,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850373415] [2025-02-07 21:19:24,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:19:24,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:19:24,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 999 statements into 1 equivalence classes. [2025-02-07 21:19:24,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 999 of 999 statements. [2025-02-07 21:19:24,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:19:24,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:19:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 25302 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 25260 trivial. 0 not checked. [2025-02-07 21:19:27,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:19:27,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850373415] [2025-02-07 21:19:27,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850373415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:19:27,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:19:27,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:19:27,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794111580] [2025-02-07 21:19:27,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:19:27,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:19:27,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:19:27,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:19:27,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:19:27,507 INFO L87 Difference]: Start difference. First operand 1198 states and 1754 transitions. Second operand has 6 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 2 states have call successors, (133), 2 states have call predecessors, (133), 1 states have return successors, (132), 1 states have call predecessors, (132), 1 states have call successors, (132) [2025-02-07 21:19:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:19:27,741 INFO L93 Difference]: Finished difference Result 1204 states and 1759 transitions. [2025-02-07 21:19:27,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:19:27,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 2 states have call successors, (133), 2 states have call predecessors, (133), 1 states have return successors, (132), 1 states have call predecessors, (132), 1 states have call successors, (132) Word has length 999 [2025-02-07 21:19:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:19:27,747 INFO L225 Difference]: With dead ends: 1204 [2025-02-07 21:19:27,747 INFO L226 Difference]: Without dead ends: 1202 [2025-02-07 21:19:27,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 21:19:27,749 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1226 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:19:27,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 6636 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:19:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2025-02-07 21:19:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1202. [2025-02-07 21:19:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 760 states have (on average 1.231578947368421) internal successors, (936), 788 states have internal predecessors, (936), 411 states have call successors, (411), 30 states have call predecessors, (411), 30 states have return successors, (410), 410 states have call predecessors, (410), 410 states have call successors, (410) [2025-02-07 21:19:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1757 transitions. [2025-02-07 21:19:27,899 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1757 transitions. Word has length 999 [2025-02-07 21:19:27,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:19:27,900 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1757 transitions. [2025-02-07 21:19:27,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 2 states have call successors, (133), 2 states have call predecessors, (133), 1 states have return successors, (132), 1 states have call predecessors, (132), 1 states have call successors, (132) [2025-02-07 21:19:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1757 transitions. [2025-02-07 21:19:27,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2025-02-07 21:19:27,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:19:27,907 INFO L218 NwaCegarLoop]: trace histogram [111, 111, 111, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:19:27,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 21:19:27,907 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:19:27,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:19:27,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1012923174, now seen corresponding path program 1 times [2025-02-07 21:19:27,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:19:27,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604918594] [2025-02-07 21:19:27,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:19:27,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:19:28,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1005 statements into 1 equivalence classes. [2025-02-07 21:19:28,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1005 of 1005 statements. [2025-02-07 21:19:28,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:19:28,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat