./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.08.cil.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/transmitter.08.cil.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 d0fbb3eaba725aed5c3b8bf09c66f0f1daed4feeee0b9a3792dc033de334e501 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:18:03,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:18:03,944 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:18:03,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:18:03,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:18:03,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:18:03,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:18:03,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:18:03,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:18:03,965 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:18:03,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:18:03,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:18:03,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:18:03,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:18:03,965 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:18:03,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:18:03,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:18:03,966 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:18:03,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:18:03,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:18:03,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:18:03,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:18:03,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:18:03,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:18:03,966 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:18:03,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:18:03,966 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:18:03,967 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:18:03,967 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:18:03,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:18:03,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:18:03,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:18:03,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:18:03,967 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:18:03,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:18:03,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:18:03,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:18:03,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:18:03,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:18:03,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:18:03,968 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:18:03,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:18:03,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:18:03,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:18:03,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:18:03,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:18:03,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:18:03,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:18:03,968 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 -> d0fbb3eaba725aed5c3b8bf09c66f0f1daed4feeee0b9a3792dc033de334e501 [2025-01-09 04:18:04,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:18:04,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:18:04,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:18:04,191 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:18:04,192 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:18:04,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.08.cil.c [2025-01-09 04:18:05,337 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2baf17f8/39597473e0a34717bdc28910463a4e3c/FLAG3f16b4be0 [2025-01-09 04:18:05,653 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:18:05,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.08.cil.c [2025-01-09 04:18:05,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2baf17f8/39597473e0a34717bdc28910463a4e3c/FLAG3f16b4be0 [2025-01-09 04:18:05,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2baf17f8/39597473e0a34717bdc28910463a4e3c [2025-01-09 04:18:05,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:18:05,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:18:05,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:18:05,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:18:05,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:18:05,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:18:05" (1/1) ... [2025-01-09 04:18:05,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66750d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:05, skipping insertion in model container [2025-01-09 04:18:05,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:18:05" (1/1) ... [2025-01-09 04:18:05,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:18:06,098 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/transmitter.08.cil.c[706,719] [2025-01-09 04:18:06,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:18:06,176 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:18:06,184 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/transmitter.08.cil.c[706,719] [2025-01-09 04:18:06,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:18:06,248 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:18:06,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:06 WrapperNode [2025-01-09 04:18:06,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:18:06,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:18:06,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:18:06,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:18:06,256 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:18:06" (1/1) ... [2025-01-09 04:18:06,268 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:18:06" (1/1) ... [2025-01-09 04:18:06,291 INFO L138 Inliner]: procedures = 44, calls = 54, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 587 [2025-01-09 04:18:06,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:18:06,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:18:06,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:18:06,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:18:06,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:06" (1/1) ... [2025-01-09 04:18:06,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:06" (1/1) ... [2025-01-09 04:18:06,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:06" (1/1) ... [2025-01-09 04:18:06,312 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:18:06,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:06" (1/1) ... [2025-01-09 04:18:06,314 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:06" (1/1) ... [2025-01-09 04:18:06,319 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:06" (1/1) ... [2025-01-09 04:18:06,320 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:06" (1/1) ... [2025-01-09 04:18:06,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:06" (1/1) ... [2025-01-09 04:18:06,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:06" (1/1) ... [2025-01-09 04:18:06,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:06" (1/1) ... [2025-01-09 04:18:06,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:18:06,330 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:18:06,330 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:18:06,330 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:18:06,332 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:06" (1/1) ... [2025-01-09 04:18:06,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:18:06,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:18:06,369 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:18:06,375 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:18:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:18:06,389 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 04:18:06,389 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 04:18:06,389 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 04:18:06,389 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 04:18:06,389 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 04:18:06,389 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 04:18:06,389 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 04:18:06,389 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 04:18:06,389 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 04:18:06,389 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 04:18:06,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:18:06,390 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 04:18:06,390 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 04:18:06,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:18:06,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:18:06,450 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:18:06,452 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:18:06,960 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-01-09 04:18:06,961 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:18:06,975 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:18:06,975 INFO L312 CfgBuilder]: Removed 12 assume(true) statements. [2025-01-09 04:18:06,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:18:06 BoogieIcfgContainer [2025-01-09 04:18:06,976 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:18:06,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:18:06,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:18:06,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:18:06,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:18:05" (1/3) ... [2025-01-09 04:18:06,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ae40e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:18:06, skipping insertion in model container [2025-01-09 04:18:06,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:18:06" (2/3) ... [2025-01-09 04:18:06,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ae40e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:18:06, skipping insertion in model container [2025-01-09 04:18:06,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:18:06" (3/3) ... [2025-01-09 04:18:06,983 INFO L128 eAbstractionObserver]: Analyzing ICFG transmitter.08.cil.c [2025-01-09 04:18:07,011 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:18:07,014 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transmitter.08.cil.c that has 7 procedures, 275 locations, 1 initial locations, 12 loop locations, and 1 error locations. [2025-01-09 04:18:07,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:18:07,083 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;@3aa5d98e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:18:07,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:18:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 275 states, 247 states have (on average 1.5991902834008098) internal successors, (395), 248 states have internal predecessors, (395), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 04:18:07,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:18:07,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:07,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:07,102 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:07,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:07,107 INFO L85 PathProgramCache]: Analyzing trace with hash -687921295, now seen corresponding path program 1 times [2025-01-09 04:18:07,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:07,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271947965] [2025-01-09 04:18:07,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:07,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:07,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:18:07,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:18:07,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:07,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:07,403 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:18:07,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:07,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271947965] [2025-01-09 04:18:07,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271947965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:07,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:07,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:18:07,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873905431] [2025-01-09 04:18:07,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:07,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:18:07,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:07,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:18:07,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:18:07,431 INFO L87 Difference]: Start difference. First operand has 275 states, 247 states have (on average 1.5991902834008098) internal successors, (395), 248 states have internal predecessors, (395), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:18:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:07,515 INFO L93 Difference]: Finished difference Result 537 states and 853 transitions. [2025-01-09 04:18:07,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:18:07,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 137 [2025-01-09 04:18:07,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:07,525 INFO L225 Difference]: With dead ends: 537 [2025-01-09 04:18:07,525 INFO L226 Difference]: Without dead ends: 270 [2025-01-09 04:18:07,528 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:18:07,537 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 411 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 421 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:18:07,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 421 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:18:07,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-09 04:18:07,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-01-09 04:18:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 242 states have (on average 1.5537190082644627) internal successors, (376), 243 states have internal predecessors, (376), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 04:18:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 418 transitions. [2025-01-09 04:18:07,599 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 418 transitions. Word has length 137 [2025-01-09 04:18:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:07,603 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 418 transitions. [2025-01-09 04:18:07,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:18:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 418 transitions. [2025-01-09 04:18:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:18:07,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:07,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:07,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:18:07,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:07,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:07,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1634959181, now seen corresponding path program 1 times [2025-01-09 04:18:07,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:07,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154939173] [2025-01-09 04:18:07,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:07,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:07,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:18:07,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:18:07,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:07,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:07,910 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:18:07,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:07,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154939173] [2025-01-09 04:18:07,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154939173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:07,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:07,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:18:07,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332514841] [2025-01-09 04:18:07,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:07,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:18:07,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:07,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:18:07,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:07,917 INFO L87 Difference]: Start difference. First operand 270 states and 418 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 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:18:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:08,502 INFO L93 Difference]: Finished difference Result 808 states and 1275 transitions. [2025-01-09 04:18:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:18:08,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 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 137 [2025-01-09 04:18:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:08,510 INFO L225 Difference]: With dead ends: 808 [2025-01-09 04:18:08,512 INFO L226 Difference]: Without dead ends: 554 [2025-01-09 04:18:08,515 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:18:08,516 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 787 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:08,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1129 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:18:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-01-09 04:18:08,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 533. [2025-01-09 04:18:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 482 states have (on average 1.5643153526970954) internal successors, (754), 484 states have internal predecessors, (754), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2025-01-09 04:18:08,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 829 transitions. [2025-01-09 04:18:08,588 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 829 transitions. Word has length 137 [2025-01-09 04:18:08,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:08,588 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 829 transitions. [2025-01-09 04:18:08,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 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:18:08,589 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 829 transitions. [2025-01-09 04:18:08,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:18:08,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:08,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:08,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:18:08,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:08,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:08,591 INFO L85 PathProgramCache]: Analyzing trace with hash -243215790, now seen corresponding path program 1 times [2025-01-09 04:18:08,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:08,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720451676] [2025-01-09 04:18:08,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:08,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:08,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:18:08,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:18:08,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:08,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:08,792 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:18:08,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:08,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720451676] [2025-01-09 04:18:08,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720451676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:08,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:08,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:18:08,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774110583] [2025-01-09 04:18:08,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:08,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:18:08,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:08,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:18:08,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:08,799 INFO L87 Difference]: Start difference. First operand 533 states and 829 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:18:09,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:09,135 INFO L93 Difference]: Finished difference Result 1101 states and 1732 transitions. [2025-01-09 04:18:09,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:18:09,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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 137 [2025-01-09 04:18:09,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:09,141 INFO L225 Difference]: With dead ends: 1101 [2025-01-09 04:18:09,141 INFO L226 Difference]: Without dead ends: 584 [2025-01-09 04:18:09,143 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:18:09,144 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 562 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:09,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 818 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:18:09,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-01-09 04:18:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 533. [2025-01-09 04:18:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 482 states have (on average 1.5601659751037344) internal successors, (752), 484 states have internal predecessors, (752), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2025-01-09 04:18:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 827 transitions. [2025-01-09 04:18:09,196 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 827 transitions. Word has length 137 [2025-01-09 04:18:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:09,197 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 827 transitions. [2025-01-09 04:18:09,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:18:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 827 transitions. [2025-01-09 04:18:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:18:09,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:09,199 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:09,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:18:09,199 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:09,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:09,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2085691504, now seen corresponding path program 1 times [2025-01-09 04:18:09,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:09,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610139102] [2025-01-09 04:18:09,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:09,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:09,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:18:09,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:18:09,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:09,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:09,355 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:18:09,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:09,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610139102] [2025-01-09 04:18:09,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610139102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:09,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:09,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:09,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520736487] [2025-01-09 04:18:09,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:09,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:09,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:09,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:09,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:09,358 INFO L87 Difference]: Start difference. First operand 533 states and 827 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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:18:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:10,184 INFO L93 Difference]: Finished difference Result 1442 states and 2257 transitions. [2025-01-09 04:18:10,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:10,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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 137 [2025-01-09 04:18:10,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:10,190 INFO L225 Difference]: With dead ends: 1442 [2025-01-09 04:18:10,190 INFO L226 Difference]: Without dead ends: 925 [2025-01-09 04:18:10,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:18:10,192 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 865 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 2152 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:10,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 2152 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:18:10,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-01-09 04:18:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 777. [2025-01-09 04:18:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 703 states have (on average 1.5519203413940257) internal successors, (1091), 706 states have internal predecessors, (1091), 53 states have call successors, (53), 18 states have call predecessors, (53), 20 states have return successors, (57), 54 states have call predecessors, (57), 53 states have call successors, (57) [2025-01-09 04:18:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1201 transitions. [2025-01-09 04:18:10,233 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1201 transitions. Word has length 137 [2025-01-09 04:18:10,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:10,233 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 1201 transitions. [2025-01-09 04:18:10,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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:18:10,234 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1201 transitions. [2025-01-09 04:18:10,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:18:10,235 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:10,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:10,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:18:10,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:10,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:10,236 INFO L85 PathProgramCache]: Analyzing trace with hash 487273106, now seen corresponding path program 1 times [2025-01-09 04:18:10,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:10,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981212260] [2025-01-09 04:18:10,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:10,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:10,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:18:10,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:18:10,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:10,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:10,389 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:18:10,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:10,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981212260] [2025-01-09 04:18:10,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981212260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:10,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:10,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:10,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99494866] [2025-01-09 04:18:10,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:10,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:10,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:10,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:10,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:10,392 INFO L87 Difference]: Start difference. First operand 777 states and 1201 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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:18:11,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:11,091 INFO L93 Difference]: Finished difference Result 2214 states and 3458 transitions. [2025-01-09 04:18:11,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:11,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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 137 [2025-01-09 04:18:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:11,099 INFO L225 Difference]: With dead ends: 2214 [2025-01-09 04:18:11,099 INFO L226 Difference]: Without dead ends: 1453 [2025-01-09 04:18:11,101 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:18:11,102 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 884 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:11,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 1511 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:18:11,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2025-01-09 04:18:11,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1294. [2025-01-09 04:18:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1172 states have (on average 1.552901023890785) internal successors, (1820), 1179 states have internal predecessors, (1820), 85 states have call successors, (85), 30 states have call predecessors, (85), 36 states have return successors, (101), 88 states have call predecessors, (101), 85 states have call successors, (101) [2025-01-09 04:18:11,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 2006 transitions. [2025-01-09 04:18:11,169 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 2006 transitions. Word has length 137 [2025-01-09 04:18:11,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:11,169 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 2006 transitions. [2025-01-09 04:18:11,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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:18:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 2006 transitions. [2025-01-09 04:18:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:18:11,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:11,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:11,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:18:11,173 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:11,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:11,177 INFO L85 PathProgramCache]: Analyzing trace with hash 154629968, now seen corresponding path program 1 times [2025-01-09 04:18:11,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:11,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033450767] [2025-01-09 04:18:11,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:11,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:11,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:18:11,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:18:11,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:11,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:11,295 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:18:11,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:11,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033450767] [2025-01-09 04:18:11,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033450767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:11,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:11,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:11,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875513484] [2025-01-09 04:18:11,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:11,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:11,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:11,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:11,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:11,297 INFO L87 Difference]: Start difference. First operand 1294 states and 2006 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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:18:12,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:12,004 INFO L93 Difference]: Finished difference Result 3869 states and 6085 transitions. [2025-01-09 04:18:12,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:12,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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 137 [2025-01-09 04:18:12,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:12,014 INFO L225 Difference]: With dead ends: 3869 [2025-01-09 04:18:12,014 INFO L226 Difference]: Without dead ends: 2591 [2025-01-09 04:18:12,017 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:18:12,017 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 855 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 2124 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:12,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 2124 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:18:12,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2025-01-09 04:18:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2409. [2025-01-09 04:18:12,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2409 states, 2185 states have (on average 1.565217391304348) internal successors, (3420), 2206 states have internal predecessors, (3420), 149 states have call successors, (149), 54 states have call predecessors, (149), 74 states have return successors, (213), 156 states have call predecessors, (213), 149 states have call successors, (213) [2025-01-09 04:18:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 2409 states and 3782 transitions. [2025-01-09 04:18:12,109 INFO L78 Accepts]: Start accepts. Automaton has 2409 states and 3782 transitions. Word has length 137 [2025-01-09 04:18:12,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:12,110 INFO L471 AbstractCegarLoop]: Abstraction has 2409 states and 3782 transitions. [2025-01-09 04:18:12,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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:18:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 3782 transitions. [2025-01-09 04:18:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:18:12,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:12,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:12,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:18:12,114 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:12,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:12,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2083562194, now seen corresponding path program 1 times [2025-01-09 04:18:12,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:12,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911506800] [2025-01-09 04:18:12,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:12,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:12,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:18:12,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:18:12,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:12,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:12,227 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:18:12,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:12,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911506800] [2025-01-09 04:18:12,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911506800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:12,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:12,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:12,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489757170] [2025-01-09 04:18:12,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:12,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:12,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:12,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:12,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:12,229 INFO L87 Difference]: Start difference. First operand 2409 states and 3782 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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:18:12,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:12,973 INFO L93 Difference]: Finished difference Result 7484 states and 11991 transitions. [2025-01-09 04:18:12,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:12,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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 137 [2025-01-09 04:18:12,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:12,994 INFO L225 Difference]: With dead ends: 7484 [2025-01-09 04:18:12,995 INFO L226 Difference]: Without dead ends: 5091 [2025-01-09 04:18:13,001 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:18:13,002 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 850 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:13,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 2112 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:18:13,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5091 states. [2025-01-09 04:18:13,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5091 to 4864. [2025-01-09 04:18:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4864 states, 4418 states have (on average 1.587143503847895) internal successors, (7012), 4485 states have internal predecessors, (7012), 277 states have call successors, (277), 102 states have call predecessors, (277), 168 states have return successors, (533), 292 states have call predecessors, (533), 277 states have call successors, (533) [2025-01-09 04:18:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4864 states to 4864 states and 7822 transitions. [2025-01-09 04:18:13,214 INFO L78 Accepts]: Start accepts. Automaton has 4864 states and 7822 transitions. Word has length 137 [2025-01-09 04:18:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:13,214 INFO L471 AbstractCegarLoop]: Abstraction has 4864 states and 7822 transitions. [2025-01-09 04:18:13,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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:18:13,215 INFO L276 IsEmpty]: Start isEmpty. Operand 4864 states and 7822 transitions. [2025-01-09 04:18:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:18:13,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:13,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:13,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:18:13,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:13,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:13,221 INFO L85 PathProgramCache]: Analyzing trace with hash -209518832, now seen corresponding path program 1 times [2025-01-09 04:18:13,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:13,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67813703] [2025-01-09 04:18:13,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:13,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:13,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:18:13,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:18:13,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:13,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:13,365 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:18:13,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:13,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67813703] [2025-01-09 04:18:13,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67813703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:13,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:13,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:13,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841035869] [2025-01-09 04:18:13,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:13,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:13,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:13,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:13,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:13,367 INFO L87 Difference]: Start difference. First operand 4864 states and 7822 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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:18:14,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:14,456 INFO L93 Difference]: Finished difference Result 15555 states and 25737 transitions. [2025-01-09 04:18:14,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:14,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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 137 [2025-01-09 04:18:14,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:14,574 INFO L225 Difference]: With dead ends: 15555 [2025-01-09 04:18:14,578 INFO L226 Difference]: Without dead ends: 10707 [2025-01-09 04:18:14,614 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:18:14,615 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 845 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:14,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 2100 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:18:14,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10707 states. [2025-01-09 04:18:15,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10707 to 10395. [2025-01-09 04:18:15,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10395 states, 9451 states have (on average 1.6154904242937256) internal successors, (15268), 9664 states have internal predecessors, (15268), 533 states have call successors, (533), 198 states have call predecessors, (533), 410 states have return successors, (1557), 564 states have call predecessors, (1557), 533 states have call successors, (1557) [2025-01-09 04:18:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10395 states to 10395 states and 17358 transitions. [2025-01-09 04:18:15,105 INFO L78 Accepts]: Start accepts. Automaton has 10395 states and 17358 transitions. Word has length 137 [2025-01-09 04:18:15,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:15,106 INFO L471 AbstractCegarLoop]: Abstraction has 10395 states and 17358 transitions. [2025-01-09 04:18:15,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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:18:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 10395 states and 17358 transitions. [2025-01-09 04:18:15,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:18:15,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:15,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:15,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:18:15,116 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:15,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:15,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1517626130, now seen corresponding path program 1 times [2025-01-09 04:18:15,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:15,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005810165] [2025-01-09 04:18:15,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:15,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:15,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:18:15,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:18:15,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:15,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:15,215 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:18:15,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:15,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005810165] [2025-01-09 04:18:15,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005810165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:15,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:15,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:18:15,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042264137] [2025-01-09 04:18:15,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:15,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:18:15,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:15,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:18:15,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:15,218 INFO L87 Difference]: Start difference. First operand 10395 states and 17358 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:18:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:15,811 INFO L93 Difference]: Finished difference Result 23224 states and 39947 transitions. [2025-01-09 04:18:15,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:18:15,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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 137 [2025-01-09 04:18:15,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:15,881 INFO L225 Difference]: With dead ends: 23224 [2025-01-09 04:18:15,881 INFO L226 Difference]: Without dead ends: 12845 [2025-01-09 04:18:15,913 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:18:15,914 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 553 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:15,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 774 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:18:15,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12845 states. [2025-01-09 04:18:16,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12845 to 10395. [2025-01-09 04:18:16,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10395 states, 9451 states have (on average 1.6119987302930907) internal successors, (15235), 9664 states have internal predecessors, (15235), 533 states have call successors, (533), 198 states have call predecessors, (533), 410 states have return successors, (1557), 564 states have call predecessors, (1557), 533 states have call successors, (1557) [2025-01-09 04:18:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10395 states to 10395 states and 17325 transitions. [2025-01-09 04:18:16,526 INFO L78 Accepts]: Start accepts. Automaton has 10395 states and 17325 transitions. Word has length 137 [2025-01-09 04:18:16,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:16,526 INFO L471 AbstractCegarLoop]: Abstraction has 10395 states and 17325 transitions. [2025-01-09 04:18:16,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:18:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand 10395 states and 17325 transitions. [2025-01-09 04:18:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:18:16,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:16,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:16,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:18:16,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:16,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:16,540 INFO L85 PathProgramCache]: Analyzing trace with hash -129736812, now seen corresponding path program 1 times [2025-01-09 04:18:16,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:16,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311774998] [2025-01-09 04:18:16,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:16,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:16,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:18:16,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:18:16,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:16,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:16,627 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:18:16,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:16,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311774998] [2025-01-09 04:18:16,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311774998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:16,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:16,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:18:16,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381824515] [2025-01-09 04:18:16,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:16,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:18:16,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:16,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:18:16,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:18:16,630 INFO L87 Difference]: Start difference. First operand 10395 states and 17325 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:18:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:17,167 INFO L93 Difference]: Finished difference Result 22979 states and 39391 transitions. [2025-01-09 04:18:17,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:18:17,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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 137 [2025-01-09 04:18:17,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:17,212 INFO L225 Difference]: With dead ends: 22979 [2025-01-09 04:18:17,212 INFO L226 Difference]: Without dead ends: 12600 [2025-01-09 04:18:17,241 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:18:17,242 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 548 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:17,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 764 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:18:17,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12600 states. [2025-01-09 04:18:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12600 to 10395. [2025-01-09 04:18:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10395 states, 9451 states have (on average 1.6085070362924558) internal successors, (15202), 9664 states have internal predecessors, (15202), 533 states have call successors, (533), 198 states have call predecessors, (533), 410 states have return successors, (1557), 564 states have call predecessors, (1557), 533 states have call successors, (1557) [2025-01-09 04:18:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10395 states to 10395 states and 17292 transitions. [2025-01-09 04:18:17,744 INFO L78 Accepts]: Start accepts. Automaton has 10395 states and 17292 transitions. Word has length 137 [2025-01-09 04:18:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:17,745 INFO L471 AbstractCegarLoop]: Abstraction has 10395 states and 17292 transitions. [2025-01-09 04:18:17,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:18:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 10395 states and 17292 transitions. [2025-01-09 04:18:17,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:18:17,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:17,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:17,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:18:17,756 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:17,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:17,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2033879762, now seen corresponding path program 1 times [2025-01-09 04:18:17,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:17,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404654523] [2025-01-09 04:18:17,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:17,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:17,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:18:17,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:18:17,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:17,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:17,864 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:18:17,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:17,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404654523] [2025-01-09 04:18:17,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404654523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:17,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:17,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:17,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578614016] [2025-01-09 04:18:17,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:17,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:17,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:17,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:17,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:17,866 INFO L87 Difference]: Start difference. First operand 10395 states and 17292 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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:18:19,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:19,216 INFO L93 Difference]: Finished difference Result 34676 states and 59534 transitions. [2025-01-09 04:18:19,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:19,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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 137 [2025-01-09 04:18:19,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:19,309 INFO L225 Difference]: With dead ends: 34676 [2025-01-09 04:18:19,309 INFO L226 Difference]: Without dead ends: 24297 [2025-01-09 04:18:19,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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:18:19,346 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 1015 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 2015 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:19,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 2015 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:18:19,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24297 states. [2025-01-09 04:18:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24297 to 22333. [2025-01-09 04:18:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22333 states, 20263 states have (on average 1.6299659477866062) internal successors, (33028), 20930 states have internal predecessors, (33028), 1013 states have call successors, (1013), 390 states have call predecessors, (1013), 1056 states have return successors, (5109), 1076 states have call predecessors, (5109), 1013 states have call successors, (5109) [2025-01-09 04:18:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22333 states to 22333 states and 39150 transitions. [2025-01-09 04:18:20,558 INFO L78 Accepts]: Start accepts. Automaton has 22333 states and 39150 transitions. Word has length 137 [2025-01-09 04:18:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:20,559 INFO L471 AbstractCegarLoop]: Abstraction has 22333 states and 39150 transitions. [2025-01-09 04:18:20,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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:18:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 22333 states and 39150 transitions. [2025-01-09 04:18:20,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:18:20,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:20,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:20,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:18:20,579 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:20,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:20,580 INFO L85 PathProgramCache]: Analyzing trace with hash 995295188, now seen corresponding path program 1 times [2025-01-09 04:18:20,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:20,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591229568] [2025-01-09 04:18:20,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:20,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:20,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:18:20,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:18:20,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:20,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:20,686 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:18:20,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:20,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591229568] [2025-01-09 04:18:20,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591229568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:20,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:20,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:20,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535431370] [2025-01-09 04:18:20,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:20,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:20,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:20,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:20,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:20,689 INFO L87 Difference]: Start difference. First operand 22333 states and 39150 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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:18:22,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:22,476 INFO L93 Difference]: Finished difference Result 74894 states and 138090 transitions. [2025-01-09 04:18:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:22,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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 137 [2025-01-09 04:18:22,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:22,682 INFO L225 Difference]: With dead ends: 74894 [2025-01-09 04:18:22,683 INFO L226 Difference]: Without dead ends: 52577 [2025-01-09 04:18:22,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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:18:22,749 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 1015 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:22,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1424 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:18:22,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52577 states. [2025-01-09 04:18:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52577 to 49272. [2025-01-09 04:18:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49272 states, 44496 states have (on average 1.6505753326141677) internal successors, (73444), 46557 states have internal predecessors, (73444), 1941 states have call successors, (1941), 774 states have call predecessors, (1941), 2834 states have return successors, (18325), 2068 states have call predecessors, (18325), 1941 states have call successors, (18325) [2025-01-09 04:18:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49272 states to 49272 states and 93710 transitions. [2025-01-09 04:18:25,620 INFO L78 Accepts]: Start accepts. Automaton has 49272 states and 93710 transitions. Word has length 137 [2025-01-09 04:18:25,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:25,620 INFO L471 AbstractCegarLoop]: Abstraction has 49272 states and 93710 transitions. [2025-01-09 04:18:25,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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:18:25,621 INFO L276 IsEmpty]: Start isEmpty. Operand 49272 states and 93710 transitions. [2025-01-09 04:18:25,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:18:25,655 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:25,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:25,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:18:25,655 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:25,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:25,656 INFO L85 PathProgramCache]: Analyzing trace with hash -977870190, now seen corresponding path program 1 times [2025-01-09 04:18:25,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:25,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916119164] [2025-01-09 04:18:25,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:25,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:25,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:18:25,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:18:25,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:25,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:25,766 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:18:25,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:25,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916119164] [2025-01-09 04:18:25,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916119164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:25,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:25,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:25,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288251357] [2025-01-09 04:18:25,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:25,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:25,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:25,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:25,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:25,767 INFO L87 Difference]: Start difference. First operand 49272 states and 93710 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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:18:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:18:30,904 INFO L93 Difference]: Finished difference Result 165711 states and 341172 transitions. [2025-01-09 04:18:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:18:30,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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 137 [2025-01-09 04:18:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:18:31,517 INFO L225 Difference]: With dead ends: 165711 [2025-01-09 04:18:31,518 INFO L226 Difference]: Without dead ends: 116455 [2025-01-09 04:18:31,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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:18:31,666 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 854 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:18:31,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1991 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:18:31,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116455 states. [2025-01-09 04:18:37,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116455 to 110977. [2025-01-09 04:18:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110977 states, 99395 states have (on average 1.6675687911866794) internal successors, (165748), 105702 states have internal predecessors, (165748), 3733 states have call successors, (3733), 1542 states have call predecessors, (3733), 7848 states have return successors, (69269), 3988 states have call predecessors, (69269), 3733 states have call successors, (69269) [2025-01-09 04:18:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110977 states to 110977 states and 238750 transitions. [2025-01-09 04:18:38,558 INFO L78 Accepts]: Start accepts. Automaton has 110977 states and 238750 transitions. Word has length 137 [2025-01-09 04:18:38,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:18:38,559 INFO L471 AbstractCegarLoop]: Abstraction has 110977 states and 238750 transitions. [2025-01-09 04:18:38,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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:18:38,560 INFO L276 IsEmpty]: Start isEmpty. Operand 110977 states and 238750 transitions. [2025-01-09 04:18:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 04:18:38,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:18:38,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:18:38,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:18:38,966 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:18:38,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:18:38,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1175236628, now seen corresponding path program 1 times [2025-01-09 04:18:38,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:18:38,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051359329] [2025-01-09 04:18:38,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:18:38,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:18:38,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 04:18:38,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 04:18:38,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:18:38,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:18:39,086 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:18:39,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:18:39,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051359329] [2025-01-09 04:18:39,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051359329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:18:39,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:18:39,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:18:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712962661] [2025-01-09 04:18:39,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:18:39,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:18:39,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:18:39,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:18:39,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:18:39,088 INFO L87 Difference]: Start difference. First operand 110977 states and 238750 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 5 states have internal predecessors, (127), 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)