./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.09.cil-1.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 834ccc2d6e5ce947bfece9c1e11f57131346eaac8927553a9495d7568350ac6e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:16:46,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:16:46,685 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:16:46,688 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:16:46,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:16:46,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:16:46,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:16:46,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:16:46,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:16:46,715 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:16:46,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:16:46,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:16:46,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:16:46,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:16:46,717 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:16:46,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:16:46,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:16:46,718 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:16:46,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:16:46,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:16:46,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:16:46,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:16:46,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:16:46,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:16:46,718 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:16:46,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:16:46,719 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:16:46,719 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:16:46,719 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:16:46,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:16:46,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:16:46,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:16:46,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:16:46,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:16:46,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:16:46,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:16:46,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:16:46,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:16:46,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:16:46,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:16:46,721 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:16:46,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:16:46,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:16:46,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:16:46,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:16:46,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:16:46,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:16:46,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:16:46,721 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 -> 834ccc2d6e5ce947bfece9c1e11f57131346eaac8927553a9495d7568350ac6e [2025-01-09 04:16:46,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:16:47,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:16:47,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:16:47,002 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:16:47,002 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:16:47,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.09.cil-1.c [2025-01-09 04:16:48,221 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae163c678/0bf4a7c3dfc2419c8206ae60b60e682f/FLAG817d11abe [2025-01-09 04:16:48,633 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:16:48,638 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.09.cil-1.c [2025-01-09 04:16:48,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae163c678/0bf4a7c3dfc2419c8206ae60b60e682f/FLAG817d11abe [2025-01-09 04:16:48,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae163c678/0bf4a7c3dfc2419c8206ae60b60e682f [2025-01-09 04:16:48,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:16:48,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:16:48,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:16:48,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:16:48,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:16:48,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:16:48" (1/1) ... [2025-01-09 04:16:48,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ebaa2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:48, skipping insertion in model container [2025-01-09 04:16:48,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:16:48" (1/1) ... [2025-01-09 04:16:48,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:16:48,946 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/systemc/token_ring.09.cil-1.c[671,684] [2025-01-09 04:16:49,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:16:49,023 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:16:49,030 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/systemc/token_ring.09.cil-1.c[671,684] [2025-01-09 04:16:49,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:16:49,076 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:16:49,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:49 WrapperNode [2025-01-09 04:16:49,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:16:49,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:16:49,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:16:49,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:16:49,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:49" (1/1) ... [2025-01-09 04:16:49,089 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:49" (1/1) ... [2025-01-09 04:16:49,111 INFO L138 Inliner]: procedures = 46, calls = 58, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 663 [2025-01-09 04:16:49,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:16:49,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:16:49,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:16:49,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:16:49,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:49" (1/1) ... [2025-01-09 04:16:49,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:49" (1/1) ... [2025-01-09 04:16:49,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:49" (1/1) ... [2025-01-09 04:16:49,131 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:16:49,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:49" (1/1) ... [2025-01-09 04:16:49,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:49" (1/1) ... [2025-01-09 04:16:49,137 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:49" (1/1) ... [2025-01-09 04:16:49,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:49" (1/1) ... [2025-01-09 04:16:49,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:49" (1/1) ... [2025-01-09 04:16:49,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:49" (1/1) ... [2025-01-09 04:16:49,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:49" (1/1) ... [2025-01-09 04:16:49,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:16:49,149 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:16:49,149 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:16:49,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:16:49,150 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:49" (1/1) ... [2025-01-09 04:16:49,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:16:49,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:16:49,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:16:49,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:16:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:16:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 04:16:49,219 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 04:16:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 04:16:49,219 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 04:16:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 04:16:49,219 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 04:16:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 04:16:49,219 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 04:16:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 04:16:49,219 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 04:16:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:16:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 04:16:49,219 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 04:16:49,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:16:49,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:16:49,308 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:16:49,310 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:16:49,956 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-01-09 04:16:49,956 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:16:49,976 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:16:49,976 INFO L312 CfgBuilder]: Removed 12 assume(true) statements. [2025-01-09 04:16:49,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:16:49 BoogieIcfgContainer [2025-01-09 04:16:49,976 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:16:49,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:16:49,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:16:49,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:16:49,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:16:48" (1/3) ... [2025-01-09 04:16:49,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69564d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:16:49, skipping insertion in model container [2025-01-09 04:16:49,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:49" (2/3) ... [2025-01-09 04:16:49,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69564d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:16:49, skipping insertion in model container [2025-01-09 04:16:49,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:16:49" (3/3) ... [2025-01-09 04:16:49,983 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.09.cil-1.c [2025-01-09 04:16:49,993 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:16:49,994 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.09.cil-1.c that has 7 procedures, 305 locations, 1 initial locations, 12 loop locations, and 1 error locations. [2025-01-09 04:16:50,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:16:50,072 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;@5b7e70d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:16:50,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:16:50,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 275 states have (on average 1.6072727272727272) internal successors, (442), 276 states have internal predecessors, (442), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 04:16:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:16:50,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:50,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:50,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:50,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:50,096 INFO L85 PathProgramCache]: Analyzing trace with hash 837633169, now seen corresponding path program 1 times [2025-01-09 04:16:50,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:50,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593464713] [2025-01-09 04:16:50,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:50,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:50,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:16:50,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:16:50,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:50,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:50,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:50,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593464713] [2025-01-09 04:16:50,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593464713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:50,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:50,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:16:50,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141509573] [2025-01-09 04:16:50,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:50,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:16:50,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:50,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:16:50,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:16:50,586 INFO L87 Difference]: Start difference. First operand has 305 states, 275 states have (on average 1.6072727272727272) internal successors, (442), 276 states have internal predecessors, (442), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:50,697 INFO L93 Difference]: Finished difference Result 597 states and 955 transitions. [2025-01-09 04:16:50,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:16:50,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 142 [2025-01-09 04:16:50,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:50,710 INFO L225 Difference]: With dead ends: 597 [2025-01-09 04:16:50,710 INFO L226 Difference]: Without dead ends: 300 [2025-01-09 04:16:50,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:16:50,723 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 462 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:50,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 472 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:16:50,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-01-09 04:16:50,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-01-09 04:16:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 270 states have (on average 1.5666666666666667) internal successors, (423), 271 states have internal predecessors, (423), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 04:16:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 469 transitions. [2025-01-09 04:16:50,807 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 469 transitions. Word has length 142 [2025-01-09 04:16:50,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:50,808 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 469 transitions. [2025-01-09 04:16:50,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:50,808 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 469 transitions. [2025-01-09 04:16:50,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:16:50,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:50,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:50,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:16:50,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:50,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:50,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1785685135, now seen corresponding path program 1 times [2025-01-09 04:16:50,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:50,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745925168] [2025-01-09 04:16:50,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:50,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:50,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:16:50,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:16:50,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:50,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:51,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:51,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745925168] [2025-01-09 04:16:51,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745925168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:51,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:51,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:16:51,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650819750] [2025-01-09 04:16:51,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:51,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:16:51,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:51,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:16:51,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:16:51,075 INFO L87 Difference]: Start difference. First operand 300 states and 469 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:51,588 INFO L93 Difference]: Finished difference Result 902 states and 1425 transitions. [2025-01-09 04:16:51,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:16:51,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 142 [2025-01-09 04:16:51,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:51,596 INFO L225 Difference]: With dead ends: 902 [2025-01-09 04:16:51,599 INFO L226 Difference]: Without dead ends: 619 [2025-01-09 04:16:51,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:51,601 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 894 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:51,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1283 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:16:51,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-01-09 04:16:51,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 596. [2025-01-09 04:16:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 541 states have (on average 1.578558225508318) internal successors, (854), 543 states have internal predecessors, (854), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-01-09 04:16:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 937 transitions. [2025-01-09 04:16:51,643 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 937 transitions. Word has length 142 [2025-01-09 04:16:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:51,644 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 937 transitions. [2025-01-09 04:16:51,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 937 transitions. [2025-01-09 04:16:51,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:16:51,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:51,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:51,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:16:51,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:51,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:51,648 INFO L85 PathProgramCache]: Analyzing trace with hash -987917037, now seen corresponding path program 1 times [2025-01-09 04:16:51,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:51,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981736270] [2025-01-09 04:16:51,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:51,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:51,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:16:51,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:16:51,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:51,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:51,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:51,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981736270] [2025-01-09 04:16:51,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981736270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:51,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:51,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:51,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030191858] [2025-01-09 04:16:51,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:51,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:51,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:51,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:51,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:51,873 INFO L87 Difference]: Start difference. First operand 596 states and 937 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:52,521 INFO L93 Difference]: Finished difference Result 1553 states and 2470 transitions. [2025-01-09 04:16:52,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:52,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 142 [2025-01-09 04:16:52,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:52,526 INFO L225 Difference]: With dead ends: 1553 [2025-01-09 04:16:52,526 INFO L226 Difference]: Without dead ends: 974 [2025-01-09 04:16:52,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:16:52,529 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 898 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:52,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 2463 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:16:52,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-01-09 04:16:52,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 871. [2025-01-09 04:16:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 791 states have (on average 1.5714285714285714) internal successors, (1243), 794 states have internal predecessors, (1243), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-01-09 04:16:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1365 transitions. [2025-01-09 04:16:52,568 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1365 transitions. Word has length 142 [2025-01-09 04:16:52,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:52,568 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1365 transitions. [2025-01-09 04:16:52,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:52,569 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1365 transitions. [2025-01-09 04:16:52,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:16:52,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:52,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:52,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:16:52,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:52,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:52,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1256641361, now seen corresponding path program 1 times [2025-01-09 04:16:52,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:52,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184866800] [2025-01-09 04:16:52,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:52,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:52,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:16:52,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:16:52,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:52,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:52,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:52,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184866800] [2025-01-09 04:16:52,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184866800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:52,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:52,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:52,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403870099] [2025-01-09 04:16:52,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:52,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:52,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:52,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:52,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:52,741 INFO L87 Difference]: Start difference. First operand 871 states and 1365 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:53,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:53,422 INFO L93 Difference]: Finished difference Result 2430 states and 3857 transitions. [2025-01-09 04:16:53,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:53,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 142 [2025-01-09 04:16:53,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:53,435 INFO L225 Difference]: With dead ends: 2430 [2025-01-09 04:16:53,436 INFO L226 Difference]: Without dead ends: 1576 [2025-01-09 04:16:53,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:16:53,442 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 893 mSDsluCounter, 1842 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 2447 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:53,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 2447 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:16:53,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2025-01-09 04:16:53,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1458. [2025-01-09 04:16:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 1326 states have (on average 1.5746606334841629) internal successors, (2088), 1333 states have internal predecessors, (2088), 95 states have call successors, (95), 30 states have call predecessors, (95), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-01-09 04:16:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2294 transitions. [2025-01-09 04:16:53,555 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 2294 transitions. Word has length 142 [2025-01-09 04:16:53,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:53,555 INFO L471 AbstractCegarLoop]: Abstraction has 1458 states and 2294 transitions. [2025-01-09 04:16:53,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2294 transitions. [2025-01-09 04:16:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:16:53,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:53,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:53,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:16:53,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:53,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:53,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1744688467, now seen corresponding path program 1 times [2025-01-09 04:16:53,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:53,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98733335] [2025-01-09 04:16:53,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:53,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:53,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:16:53,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:16:53,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:53,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:53,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:53,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98733335] [2025-01-09 04:16:53,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98733335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:53,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:53,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:53,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477309607] [2025-01-09 04:16:53,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:53,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:53,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:53,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:53,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:53,709 INFO L87 Difference]: Start difference. First operand 1458 states and 2294 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:54,468 INFO L93 Difference]: Finished difference Result 4327 states and 6920 transitions. [2025-01-09 04:16:54,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:54,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 142 [2025-01-09 04:16:54,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:54,482 INFO L225 Difference]: With dead ends: 4327 [2025-01-09 04:16:54,483 INFO L226 Difference]: Without dead ends: 2886 [2025-01-09 04:16:54,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:16:54,487 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 888 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 2435 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:54,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 2435 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:16:54,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2025-01-09 04:16:54,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2737. [2025-01-09 04:16:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2737 states, 2495 states have (on average 1.590380761523046) internal successors, (3968), 2516 states have internal predecessors, (3968), 167 states have call successors, (167), 54 states have call predecessors, (167), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-01-09 04:16:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2737 states and 4366 transitions. [2025-01-09 04:16:54,603 INFO L78 Accepts]: Start accepts. Automaton has 2737 states and 4366 transitions. Word has length 142 [2025-01-09 04:16:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:54,604 INFO L471 AbstractCegarLoop]: Abstraction has 2737 states and 4366 transitions. [2025-01-09 04:16:54,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 4366 transitions. [2025-01-09 04:16:54,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:16:54,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:54,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:54,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:16:54,606 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:54,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:54,607 INFO L85 PathProgramCache]: Analyzing trace with hash 652053265, now seen corresponding path program 1 times [2025-01-09 04:16:54,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:54,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056840848] [2025-01-09 04:16:54,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:54,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:54,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:16:54,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:16:54,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:54,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:54,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:54,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056840848] [2025-01-09 04:16:54,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056840848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:54,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:54,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:54,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81195844] [2025-01-09 04:16:54,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:54,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:54,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:54,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:54,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:54,716 INFO L87 Difference]: Start difference. First operand 2737 states and 4366 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:55,466 INFO L93 Difference]: Finished difference Result 8522 states and 13890 transitions. [2025-01-09 04:16:55,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:55,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 142 [2025-01-09 04:16:55,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:55,494 INFO L225 Difference]: With dead ends: 8522 [2025-01-09 04:16:55,494 INFO L226 Difference]: Without dead ends: 5802 [2025-01-09 04:16:55,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:16:55,504 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 883 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 2423 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:55,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 2423 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:16:55,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5802 states. [2025-01-09 04:16:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5802 to 5592. [2025-01-09 04:16:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5592 states, 5112 states have (on average 1.6165884194053208) internal successors, (8264), 5179 states have internal predecessors, (8264), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-01-09 04:16:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5592 states to 5592 states and 9142 transitions. [2025-01-09 04:16:55,777 INFO L78 Accepts]: Start accepts. Automaton has 5592 states and 9142 transitions. Word has length 142 [2025-01-09 04:16:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:55,777 INFO L471 AbstractCegarLoop]: Abstraction has 5592 states and 9142 transitions. [2025-01-09 04:16:55,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5592 states and 9142 transitions. [2025-01-09 04:16:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:16:55,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:55,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:55,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:16:55,782 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:55,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:55,783 INFO L85 PathProgramCache]: Analyzing trace with hash -630119021, now seen corresponding path program 1 times [2025-01-09 04:16:55,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:55,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60624116] [2025-01-09 04:16:55,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:55,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:55,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:16:55,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:16:55,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:55,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:55,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:55,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60624116] [2025-01-09 04:16:55,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60624116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:55,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:55,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:55,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563291878] [2025-01-09 04:16:55,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:55,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:55,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:55,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:55,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:55,900 INFO L87 Difference]: Start difference. First operand 5592 states and 9142 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:56,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:56,915 INFO L93 Difference]: Finished difference Result 17941 states and 30140 transitions. [2025-01-09 04:16:56,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:56,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 142 [2025-01-09 04:16:56,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:56,970 INFO L225 Difference]: With dead ends: 17941 [2025-01-09 04:16:56,970 INFO L226 Difference]: Without dead ends: 12366 [2025-01-09 04:16:56,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:16:56,990 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 907 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:56,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1702 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:16:56,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12366 states. [2025-01-09 04:16:57,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12366 to 12058. [2025-01-09 04:16:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12058 states, 11048 states have (on average 1.6471759594496742) internal successors, (18198), 11261 states have internal predecessors, (18198), 599 states have call successors, (599), 198 states have call predecessors, (599), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-01-09 04:16:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12058 states to 12058 states and 20420 transitions. [2025-01-09 04:16:58,039 INFO L78 Accepts]: Start accepts. Automaton has 12058 states and 20420 transitions. Word has length 142 [2025-01-09 04:16:58,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:58,043 INFO L471 AbstractCegarLoop]: Abstraction has 12058 states and 20420 transitions. [2025-01-09 04:16:58,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 12058 states and 20420 transitions. [2025-01-09 04:16:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:16:58,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:58,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:16:58,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:16:58,063 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:58,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:58,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1942845589, now seen corresponding path program 1 times [2025-01-09 04:16:58,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:58,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415319464] [2025-01-09 04:16:58,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:58,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:58,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:16:58,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:16:58,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:58,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:16:58,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:58,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415319464] [2025-01-09 04:16:58,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415319464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:58,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:58,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:58,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178502206] [2025-01-09 04:16:58,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:58,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:58,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:58,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:58,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:58,206 INFO L87 Difference]: Start difference. First operand 12058 states and 20420 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:16:59,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:59,478 INFO L93 Difference]: Finished difference Result 39731 states and 69792 transitions. [2025-01-09 04:16:59,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:59,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 142 [2025-01-09 04:16:59,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:59,625 INFO L225 Difference]: With dead ends: 39731 [2025-01-09 04:16:59,625 INFO L226 Difference]: Without dead ends: 27690 [2025-01-09 04:16:59,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:16:59,675 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 870 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:59,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 2385 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:16:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27690 states. [2025-01-09 04:17:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27690 to 27177. [2025-01-09 04:17:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27177 states, 24945 states have (on average 1.6812186810984164) internal successors, (41938), 25612 states have internal predecessors, (41938), 1175 states have call successors, (1175), 390 states have call predecessors, (1175), 1056 states have return successors, (5271), 1238 states have call predecessors, (5271), 1175 states have call successors, (5271) [2025-01-09 04:17:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27177 states to 27177 states and 48384 transitions. [2025-01-09 04:17:00,817 INFO L78 Accepts]: Start accepts. Automaton has 27177 states and 48384 transitions. Word has length 142 [2025-01-09 04:17:00,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:00,818 INFO L471 AbstractCegarLoop]: Abstraction has 27177 states and 48384 transitions. [2025-01-09 04:17:00,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 27177 states and 48384 transitions. [2025-01-09 04:17:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:17:00,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:00,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:17:00,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:17:00,830 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:00,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:00,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1610202451, now seen corresponding path program 1 times [2025-01-09 04:17:00,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:00,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885047863] [2025-01-09 04:17:00,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:00,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:00,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:17:00,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:17:00,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:00,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:17:00,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:00,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885047863] [2025-01-09 04:17:00,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885047863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:00,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:00,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:00,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88276653] [2025-01-09 04:17:00,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:00,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:00,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:00,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:00,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:00,950 INFO L87 Difference]: Start difference. First operand 27177 states and 48384 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:02,865 INFO L93 Difference]: Finished difference Result 91544 states and 171250 transitions. [2025-01-09 04:17:02,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:02,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 142 [2025-01-09 04:17:02,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:03,162 INFO L225 Difference]: With dead ends: 91544 [2025-01-09 04:17:03,163 INFO L226 Difference]: Without dead ends: 64384 [2025-01-09 04:17:03,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:17:03,268 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 865 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 2373 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:03,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 2373 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:17:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64384 states. [2025-01-09 04:17:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64384 to 63490. [2025-01-09 04:17:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63490 states, 58328 states have (on average 1.7157797284323137) internal successors, (100078), 60389 states have internal predecessors, (100078), 2327 states have call successors, (2327), 774 states have call predecessors, (2327), 2834 states have return successors, (18711), 2454 states have call predecessors, (18711), 2327 states have call successors, (18711) [2025-01-09 04:17:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63490 states to 63490 states and 121116 transitions. [2025-01-09 04:17:05,733 INFO L78 Accepts]: Start accepts. Automaton has 63490 states and 121116 transitions. Word has length 142 [2025-01-09 04:17:05,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:05,734 INFO L471 AbstractCegarLoop]: Abstraction has 63490 states and 121116 transitions. [2025-01-09 04:17:05,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 63490 states and 121116 transitions. [2025-01-09 04:17:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:17:05,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:05,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:17:05,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:17:05,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:05,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:05,756 INFO L85 PathProgramCache]: Analyzing trace with hash -755832619, now seen corresponding path program 1 times [2025-01-09 04:17:05,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:05,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156211672] [2025-01-09 04:17:05,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:05,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:05,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:17:05,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:17:05,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:05,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:17:05,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:05,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156211672] [2025-01-09 04:17:05,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156211672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:05,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:05,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:05,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532954777] [2025-01-09 04:17:05,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:05,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:05,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:05,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:05,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:05,872 INFO L87 Difference]: Start difference. First operand 63490 states and 121116 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:10,430 INFO L93 Difference]: Finished difference Result 217951 states and 444520 transitions. [2025-01-09 04:17:10,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:10,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 142 [2025-01-09 04:17:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:11,345 INFO L225 Difference]: With dead ends: 217951 [2025-01-09 04:17:11,345 INFO L226 Difference]: Without dead ends: 154478 [2025-01-09 04:17:11,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:17:11,611 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 860 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 2361 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:11,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 2361 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:17:11,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154478 states. [2025-01-09 04:17:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154478 to 152883. [2025-01-09 04:17:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152883 states, 140403 states have (on average 1.7482105083224717) internal successors, (245454), 146710 states have internal predecessors, (245454), 4631 states have call successors, (4631), 1542 states have call predecessors, (4631), 7848 states have return successors, (70167), 4886 states have call predecessors, (70167), 4631 states have call successors, (70167) [2025-01-09 04:17:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152883 states to 152883 states and 320252 transitions. [2025-01-09 04:17:19,434 INFO L78 Accepts]: Start accepts. Automaton has 152883 states and 320252 transitions. Word has length 142 [2025-01-09 04:17:19,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:19,434 INFO L471 AbstractCegarLoop]: Abstraction has 152883 states and 320252 transitions. [2025-01-09 04:17:19,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 04:17:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 152883 states and 320252 transitions. [2025-01-09 04:17:19,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:17:19,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:19,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:17:19,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:17:19,472 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:19,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:19,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1246053651, now seen corresponding path program 1 times [2025-01-09 04:17:19,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:19,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289525488] [2025-01-09 04:17:19,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:19,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:19,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:17:19,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:17:19,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:19,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:17:19,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:19,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289525488] [2025-01-09 04:17:19,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289525488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:19,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:19,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:19,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57839133] [2025-01-09 04:17:19,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:19,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:19,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:19,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:19,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:19,557 INFO L87 Difference]: Start difference. First operand 152883 states and 320252 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 5 states have internal predecessors, (132), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)