./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.08.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.08.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 42e706fd1a5bd201d46dd2f3322f156b6d900789b8c9ace16cba5458f69fdc62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:16:45,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:16:45,488 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:45,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:16:45,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:16:45,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:16:45,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:16:45,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:16:45,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:16:45,523 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:16:45,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:16:45,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:16:45,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:16:45,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:16:45,525 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:16:45,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:16:45,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:16:45,525 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:16:45,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:16:45,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:16:45,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:16:45,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:16:45,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:16:45,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:16:45,525 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:16:45,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:16:45,526 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:16:45,526 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:16:45,526 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:16:45,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:16:45,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:16:45,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:16:45,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:16:45,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:16:45,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:16:45,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:16:45,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:16:45,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:16:45,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:16:45,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:16:45,528 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:16:45,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:16:45,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:16:45,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:16:45,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:16:45,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:16:45,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:16:45,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:16:45,529 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 -> 42e706fd1a5bd201d46dd2f3322f156b6d900789b8c9ace16cba5458f69fdc62 [2025-01-09 04:16:45,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:16:45,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:16:45,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:16:45,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:16:45,855 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:16:45,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.08.cil-1.c [2025-01-09 04:16:47,200 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/176165085/238f4b1fc552482ea2d4bdaf848eecc6/FLAGf9aff844f [2025-01-09 04:16:47,489 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:16:47,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.08.cil-1.c [2025-01-09 04:16:47,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/176165085/238f4b1fc552482ea2d4bdaf848eecc6/FLAGf9aff844f [2025-01-09 04:16:47,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/176165085/238f4b1fc552482ea2d4bdaf848eecc6 [2025-01-09 04:16:47,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:16:47,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:16:47,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:16:47,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:16:47,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:16:47,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:16:47" (1/1) ... [2025-01-09 04:16:47,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a210d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:47, skipping insertion in model container [2025-01-09 04:16:47,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:16:47" (1/1) ... [2025-01-09 04:16:47,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:16:47,716 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.08.cil-1.c[671,684] [2025-01-09 04:16:47,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:16:47,852 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:16:47,862 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.08.cil-1.c[671,684] [2025-01-09 04:16:47,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:16:47,954 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:16:47,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:47 WrapperNode [2025-01-09 04:16:47,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:16:47,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:16:47,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:16:47,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:16:47,965 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:47" (1/1) ... [2025-01-09 04:16:47,975 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:47" (1/1) ... [2025-01-09 04:16:48,005 INFO L138 Inliner]: procedures = 44, calls = 55, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 606 [2025-01-09 04:16:48,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:16:48,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:16:48,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:16:48,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:16:48,014 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:47" (1/1) ... [2025-01-09 04:16:48,015 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:47" (1/1) ... [2025-01-09 04:16:48,019 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:47" (1/1) ... [2025-01-09 04:16:48,033 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:48,033 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:47" (1/1) ... [2025-01-09 04:16:48,034 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:47" (1/1) ... [2025-01-09 04:16:48,045 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:47" (1/1) ... [2025-01-09 04:16:48,046 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:47" (1/1) ... [2025-01-09 04:16:48,064 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:47" (1/1) ... [2025-01-09 04:16:48,071 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:47" (1/1) ... [2025-01-09 04:16:48,072 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:47" (1/1) ... [2025-01-09 04:16:48,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:16:48,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:16:48,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:16:48,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:16:48,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:47" (1/1) ... [2025-01-09 04:16:48,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:16:48,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:16:48,118 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:48,121 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:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:16:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 04:16:48,141 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 04:16:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 04:16:48,141 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 04:16:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 04:16:48,141 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 04:16:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 04:16:48,141 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 04:16:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 04:16:48,141 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 04:16:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:16:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 04:16:48,142 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 04:16:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:16:48,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:16:48,238 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:16:48,241 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:16:49,047 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-01-09 04:16:49,048 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:16:49,091 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:16:49,092 INFO L312 CfgBuilder]: Removed 11 assume(true) statements. [2025-01-09 04:16:49,092 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,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:16:49,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:16:49,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:16:49,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:16:49,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:16:47" (1/3) ... [2025-01-09 04:16:49,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aabe52b 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,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:16:47" (2/3) ... [2025-01-09 04:16:49,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aabe52b 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,100 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,101 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.08.cil-1.c [2025-01-09 04:16:49,112 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:16:49,113 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.08.cil-1.c that has 7 procedures, 280 locations, 1 initial locations, 11 loop locations, and 1 error locations. [2025-01-09 04:16:49,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:16:49,188 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;@22b31012, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:16:49,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:16:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 280 states, 251 states have (on average 1.6015936254980079) internal successors, (402), 252 states have internal predecessors, (402), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 04:16:49,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:16:49,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:49,212 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] [2025-01-09 04:16:49,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:49,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:49,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1247007223, now seen corresponding path program 1 times [2025-01-09 04:16:49,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:49,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223074787] [2025-01-09 04:16:49,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:49,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:49,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:16:49,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:16:49,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:49,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:49,596 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:49,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:49,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223074787] [2025-01-09 04:16:49,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223074787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:49,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:49,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:16:49,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307887703] [2025-01-09 04:16:49,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:49,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:16:49,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:49,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:16:49,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:16:49,631 INFO L87 Difference]: Start difference. First operand has 280 states, 251 states have (on average 1.6015936254980079) internal successors, (402), 252 states have internal predecessors, (402), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:49,716 INFO L93 Difference]: Finished difference Result 549 states and 875 transitions. [2025-01-09 04:16:49,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:16:49,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 131 [2025-01-09 04:16:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:49,731 INFO L225 Difference]: With dead ends: 549 [2025-01-09 04:16:49,731 INFO L226 Difference]: Without dead ends: 275 [2025-01-09 04:16:49,735 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:49,739 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 423 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 431 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:49,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 431 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:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-01-09 04:16:49,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-01-09 04:16:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 246 states have (on average 1.5609756097560976) internal successors, (384), 247 states have internal predecessors, (384), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 04:16:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 428 transitions. [2025-01-09 04:16:49,804 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 428 transitions. Word has length 131 [2025-01-09 04:16:49,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:49,805 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 428 transitions. [2025-01-09 04:16:49,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 428 transitions. [2025-01-09 04:16:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:16:49,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:49,808 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] [2025-01-09 04:16:49,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:16:49,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:49,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:49,810 INFO L85 PathProgramCache]: Analyzing trace with hash -154372021, now seen corresponding path program 1 times [2025-01-09 04:16:49,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:49,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447238619] [2025-01-09 04:16:49,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:49,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:49,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:16:49,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:16:49,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:49,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:50,190 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,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:50,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447238619] [2025-01-09 04:16:50,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447238619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:50,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:50,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:16:50,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073634790] [2025-01-09 04:16:50,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:50,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:16:50,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:50,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:16:50,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:16:50,196 INFO L87 Difference]: Start difference. First operand 275 states and 428 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 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:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:50,845 INFO L93 Difference]: Finished difference Result 825 states and 1298 transitions. [2025-01-09 04:16:50,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:16:50,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 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 131 [2025-01-09 04:16:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:50,852 INFO L225 Difference]: With dead ends: 825 [2025-01-09 04:16:50,852 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 04:16:50,854 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:50,855 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 809 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:50,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1167 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:16:50,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 04:16:50,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 545. [2025-01-09 04:16:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 492 states have (on average 1.5731707317073171) internal successors, (774), 494 states have internal predecessors, (774), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-01-09 04:16:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 853 transitions. [2025-01-09 04:16:50,930 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 853 transitions. Word has length 131 [2025-01-09 04:16:50,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:50,930 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 853 transitions. [2025-01-09 04:16:50,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 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:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 853 transitions. [2025-01-09 04:16:50,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:16:50,933 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:50,933 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] [2025-01-09 04:16:50,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:16:50,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:50,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:50,934 INFO L85 PathProgramCache]: Analyzing trace with hash 728767439, now seen corresponding path program 1 times [2025-01-09 04:16:50,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:50,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895830931] [2025-01-09 04:16:50,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:50,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:50,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:16:50,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:16:50,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:50,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:51,208 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,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:51,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895830931] [2025-01-09 04:16:51,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895830931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:51,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:51,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:51,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305337895] [2025-01-09 04:16:51,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:51,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:51,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:51,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:51,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:51,211 INFO L87 Difference]: Start difference. First operand 545 states and 853 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:51,989 INFO L93 Difference]: Finished difference Result 1418 states and 2245 transitions. [2025-01-09 04:16:51,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:51,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2025-01-09 04:16:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:51,995 INFO L225 Difference]: With dead ends: 1418 [2025-01-09 04:16:51,995 INFO L226 Difference]: Without dead ends: 889 [2025-01-09 04:16:51,998 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:51,998 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 811 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 2234 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:51,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 2234 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:16:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-01-09 04:16:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 796. [2025-01-09 04:16:52,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 719 states have (on average 1.5660639777468706) internal successors, (1126), 722 states have internal predecessors, (1126), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-01-09 04:16:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1242 transitions. [2025-01-09 04:16:52,049 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1242 transitions. Word has length 131 [2025-01-09 04:16:52,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:52,050 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1242 transitions. [2025-01-09 04:16:52,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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,050 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1242 transitions. [2025-01-09 04:16:52,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:16:52,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:52,054 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] [2025-01-09 04:16:52,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:16:52,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:52,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:52,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1200123789, now seen corresponding path program 1 times [2025-01-09 04:16:52,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:52,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494401213] [2025-01-09 04:16:52,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:52,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:52,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:16:52,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:16:52,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:52,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:52,302 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,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:52,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494401213] [2025-01-09 04:16:52,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494401213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:52,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:52,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:52,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155701913] [2025-01-09 04:16:52,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:52,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:52,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:52,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:52,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:52,306 INFO L87 Difference]: Start difference. First operand 796 states and 1242 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:52,985 INFO L93 Difference]: Finished difference Result 2217 states and 3503 transitions. [2025-01-09 04:16:52,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:52,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2025-01-09 04:16:52,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:52,993 INFO L225 Difference]: With dead ends: 2217 [2025-01-09 04:16:52,994 INFO L226 Difference]: Without dead ends: 1437 [2025-01-09 04:16:52,996 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,997 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 830 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:52,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 1571 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:16:52,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2025-01-09 04:16:53,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1331. [2025-01-09 04:16:53,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1204 states have (on average 1.568936877076412) internal successors, (1889), 1211 states have internal predecessors, (1889), 90 states have call successors, (90), 30 states have call predecessors, (90), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-01-09 04:16:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2085 transitions. [2025-01-09 04:16:53,070 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2085 transitions. Word has length 131 [2025-01-09 04:16:53,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:53,071 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 2085 transitions. [2025-01-09 04:16:53,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2085 transitions. [2025-01-09 04:16:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:16:53,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:53,073 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] [2025-01-09 04:16:53,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:16:53,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:53,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:53,074 INFO L85 PathProgramCache]: Analyzing trace with hash -447239153, now seen corresponding path program 1 times [2025-01-09 04:16:53,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:53,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965078312] [2025-01-09 04:16:53,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:53,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:53,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:16:53,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:16:53,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:53,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:53,276 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,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:53,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965078312] [2025-01-09 04:16:53,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965078312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:53,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:53,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:53,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051315061] [2025-01-09 04:16:53,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:53,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:53,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:53,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:53,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:53,279 INFO L87 Difference]: Start difference. First operand 1331 states and 2085 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:54,078 INFO L93 Difference]: Finished difference Result 3942 states and 6276 transitions. [2025-01-09 04:16:54,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:54,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2025-01-09 04:16:54,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:54,095 INFO L225 Difference]: With dead ends: 3942 [2025-01-09 04:16:54,096 INFO L226 Difference]: Without dead ends: 2627 [2025-01-09 04:16:54,101 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,102 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 801 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:54,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 2206 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:16:54,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2025-01-09 04:16:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2494. [2025-01-09 04:16:54,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2494 states, 2261 states have (on average 1.5838124723573639) internal successors, (3581), 2282 states have internal predecessors, (3581), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-01-09 04:16:54,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 3961 transitions. [2025-01-09 04:16:54,273 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 3961 transitions. Word has length 131 [2025-01-09 04:16:54,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:54,275 INFO L471 AbstractCegarLoop]: Abstraction has 2494 states and 3961 transitions. [2025-01-09 04:16:54,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 3961 transitions. [2025-01-09 04:16:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:16:54,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:54,280 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] [2025-01-09 04:16:54,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:16:54,280 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:54,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:54,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1716377421, now seen corresponding path program 1 times [2025-01-09 04:16:54,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:54,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140375895] [2025-01-09 04:16:54,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:54,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:54,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:16:54,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:16:54,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:54,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:54,469 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,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:54,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140375895] [2025-01-09 04:16:54,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140375895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:54,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:54,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:54,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471620379] [2025-01-09 04:16:54,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:54,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:54,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:54,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:54,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:54,471 INFO L87 Difference]: Start difference. First operand 2494 states and 3961 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:55,255 INFO L93 Difference]: Finished difference Result 7745 states and 12570 transitions. [2025-01-09 04:16:55,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:55,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2025-01-09 04:16:55,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:55,287 INFO L225 Difference]: With dead ends: 7745 [2025-01-09 04:16:55,287 INFO L226 Difference]: Without dead ends: 5267 [2025-01-09 04:16:55,297 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,298 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 796 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:55,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 2194 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:16:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2025-01-09 04:16:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 5081. [2025-01-09 04:16:55,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5081 states, 4618 states have (on average 1.6087050671286272) internal successors, (7429), 4685 states have internal predecessors, (7429), 294 states have call successors, (294), 102 states have call predecessors, (294), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-01-09 04:16:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5081 states to 5081 states and 8273 transitions. [2025-01-09 04:16:55,608 INFO L78 Accepts]: Start accepts. Automaton has 5081 states and 8273 transitions. Word has length 131 [2025-01-09 04:16:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:55,608 INFO L471 AbstractCegarLoop]: Abstraction has 5081 states and 8273 transitions. [2025-01-09 04:16:55,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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,609 INFO L276 IsEmpty]: Start isEmpty. Operand 5081 states and 8273 transitions. [2025-01-09 04:16:55,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:16:55,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:55,613 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] [2025-01-09 04:16:55,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:16:55,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:55,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:55,615 INFO L85 PathProgramCache]: Analyzing trace with hash 677792847, now seen corresponding path program 1 times [2025-01-09 04:16:55,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:55,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610454255] [2025-01-09 04:16:55,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:55,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:55,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:16:55,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:16:55,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:55,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:55,789 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,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:55,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610454255] [2025-01-09 04:16:55,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610454255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:55,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:55,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:55,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806747390] [2025-01-09 04:16:55,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:55,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:55,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:55,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:55,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:55,791 INFO L87 Difference]: Start difference. First operand 5081 states and 8273 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:56,793 INFO L93 Difference]: Finished difference Result 16336 states and 27380 transitions. [2025-01-09 04:16:56,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:56,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2025-01-09 04:16:56,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:56,859 INFO L225 Difference]: With dead ends: 16336 [2025-01-09 04:16:56,860 INFO L226 Difference]: Without dead ends: 11271 [2025-01-09 04:16:56,878 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,879 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 791 mSDsluCounter, 1641 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:56,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 2182 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:16:56,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11271 states. [2025-01-09 04:16:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11271 to 10984. [2025-01-09 04:16:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10984 states, 10007 states have (on average 1.640151893674428) internal successors, (16413), 10220 states have internal predecessors, (16413), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-01-09 04:16:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10984 states to 10984 states and 18569 transitions. [2025-01-09 04:16:57,566 INFO L78 Accepts]: Start accepts. Automaton has 10984 states and 18569 transitions. Word has length 131 [2025-01-09 04:16:57,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:16:57,568 INFO L471 AbstractCegarLoop]: Abstraction has 10984 states and 18569 transitions. [2025-01-09 04:16:57,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 10984 states and 18569 transitions. [2025-01-09 04:16:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:16:57,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:16:57,578 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] [2025-01-09 04:16:57,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:16:57,579 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:16:57,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:16:57,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1295372531, now seen corresponding path program 1 times [2025-01-09 04:16:57,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:16:57,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629511814] [2025-01-09 04:16:57,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:16:57,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:16:57,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:16:57,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:16:57,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:16:57,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:16:57,797 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:57,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:16:57,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629511814] [2025-01-09 04:16:57,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629511814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:16:57,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:16:57,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:16:57,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644847962] [2025-01-09 04:16:57,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:16:57,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:16:57,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:16:57,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:16:57,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:16:57,800 INFO L87 Difference]: Start difference. First operand 10984 states and 18569 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:16:59,156 INFO L93 Difference]: Finished difference Result 36259 states and 63730 transitions. [2025-01-09 04:16:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:16:59,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2025-01-09 04:16:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:16:59,424 INFO L225 Difference]: With dead ends: 36259 [2025-01-09 04:16:59,424 INFO L226 Difference]: Without dead ends: 25291 [2025-01-09 04:16:59,477 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,478 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 786 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 2170 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:16:59,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 2170 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:16:59,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25291 states. [2025-01-09 04:17:00,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25291 to 24815. [2025-01-09 04:17:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24815 states, 22648 states have (on average 1.6747174143412222) internal successors, (37929), 23315 states have internal predecessors, (37929), 1110 states have call successors, (1110), 390 states have call predecessors, (1110), 1056 states have return successors, (5206), 1173 states have call predecessors, (5206), 1110 states have call successors, (5206) [2025-01-09 04:17:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24815 states to 24815 states and 44245 transitions. [2025-01-09 04:17:00,876 INFO L78 Accepts]: Start accepts. Automaton has 24815 states and 44245 transitions. Word has length 131 [2025-01-09 04:17:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:00,877 INFO L471 AbstractCegarLoop]: Abstraction has 24815 states and 44245 transitions. [2025-01-09 04:17:00,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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,878 INFO L276 IsEmpty]: Start isEmpty. Operand 24815 states and 44245 transitions. [2025-01-09 04:17:00,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:17:00,892 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:00,892 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] [2025-01-09 04:17:00,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:17:00,892 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:00,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:00,893 INFO L85 PathProgramCache]: Analyzing trace with hash 857734287, now seen corresponding path program 1 times [2025-01-09 04:17:00,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:00,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475822532] [2025-01-09 04:17:00,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:00,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:00,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:17:00,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:17:00,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:00,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:01,034 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:01,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:01,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475822532] [2025-01-09 04:17:01,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475822532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:01,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:01,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:01,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035759026] [2025-01-09 04:17:01,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:01,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:01,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:01,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:01,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:01,037 INFO L87 Difference]: Start difference. First operand 24815 states and 44245 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:03,620 INFO L93 Difference]: Finished difference Result 82894 states and 155696 transitions. [2025-01-09 04:17:03,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:03,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2025-01-09 04:17:03,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:04,018 INFO L225 Difference]: With dead ends: 82894 [2025-01-09 04:17:04,018 INFO L226 Difference]: Without dead ends: 58095 [2025-01-09 04:17:04,151 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:04,153 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 778 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 2144 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:04,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 2144 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:17:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58095 states. [2025-01-09 04:17:06,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58095 to 57337. [2025-01-09 04:17:06,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57337 states, 52304 states have (on average 1.7052424288773325) internal successors, (89191), 54365 states have internal predecessors, (89191), 2198 states have call successors, (2198), 774 states have call predecessors, (2198), 2834 states have return successors, (18582), 2325 states have call predecessors, (18582), 2198 states have call successors, (18582) [2025-01-09 04:17:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57337 states to 57337 states and 109971 transitions. [2025-01-09 04:17:07,318 INFO L78 Accepts]: Start accepts. Automaton has 57337 states and 109971 transitions. Word has length 131 [2025-01-09 04:17:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:07,319 INFO L471 AbstractCegarLoop]: Abstraction has 57337 states and 109971 transitions. [2025-01-09 04:17:07,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 57337 states and 109971 transitions. [2025-01-09 04:17:07,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:17:07,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:07,353 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] [2025-01-09 04:17:07,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:17:07,354 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:07,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash 976175761, now seen corresponding path program 1 times [2025-01-09 04:17:07,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:07,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905807093] [2025-01-09 04:17:07,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:07,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:17:07,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:17:07,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:07,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:07,519 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:07,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:07,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905807093] [2025-01-09 04:17:07,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905807093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:07,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:07,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:17:07,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201641034] [2025-01-09 04:17:07,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:07,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:17:07,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:07,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:17:07,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:17:07,521 INFO L87 Difference]: Start difference. First operand 57337 states and 109971 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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:12,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:12,121 INFO L93 Difference]: Finished difference Result 202692 states and 413765 transitions. [2025-01-09 04:17:12,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:17:12,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2025-01-09 04:17:12,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:13,190 INFO L225 Difference]: With dead ends: 202692 [2025-01-09 04:17:13,190 INFO L226 Difference]: Without dead ends: 145371 [2025-01-09 04:17:13,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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:13,330 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 1027 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:13,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 2119 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:17:13,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145371 states. [2025-01-09 04:17:19,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145371 to 135848. [2025-01-09 04:17:19,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135848 states, 123753 states have (on average 1.735093290667701) internal successors, (214723), 130060 states have internal predecessors, (214723), 4246 states have call successors, (4246), 1542 states have call predecessors, (4246), 7848 states have return successors, (69782), 4501 states have call predecessors, (69782), 4246 states have call successors, (69782) [2025-01-09 04:17:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135848 states to 135848 states and 288751 transitions. [2025-01-09 04:17:20,402 INFO L78 Accepts]: Start accepts. Automaton has 135848 states and 288751 transitions. Word has length 131 [2025-01-09 04:17:20,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:17:20,402 INFO L471 AbstractCegarLoop]: Abstraction has 135848 states and 288751 transitions. [2025-01-09 04:17:20,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 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:20,403 INFO L276 IsEmpty]: Start isEmpty. Operand 135848 states and 288751 transitions. [2025-01-09 04:17:20,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:17:20,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:17:20,458 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] [2025-01-09 04:17:20,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:17:20,459 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:17:20,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:17:20,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1929497521, now seen corresponding path program 1 times [2025-01-09 04:17:20,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:17:20,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849314328] [2025-01-09 04:17:20,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:17:20,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:17:20,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:17:20,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:17:20,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:17:20,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:17:20,626 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:20,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:17:20,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849314328] [2025-01-09 04:17:20,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849314328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:17:20,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:17:20,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:17:20,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409873258] [2025-01-09 04:17:20,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:17:20,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:17:20,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:17:20,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:17:20,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:17:20,633 INFO L87 Difference]: Start difference. First operand 135848 states and 288751 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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:28,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:17:28,173 INFO L93 Difference]: Finished difference Result 330747 states and 741973 transitions. [2025-01-09 04:17:28,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:17:28,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2025-01-09 04:17:28,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:17:29,326 INFO L225 Difference]: With dead ends: 330747 [2025-01-09 04:17:29,326 INFO L226 Difference]: Without dead ends: 194915 [2025-01-09 04:17:29,696 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:17:29,697 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 579 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:17:29,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 755 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:17:29,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194915 states.